Barrier-aware graphics cluster scheduling mechanism

ABSTRACT

An apparatus to facilitate thread scheduling is disclosed. In one embodiment the apparatus includes a processor comprising a plurality of multiprocessors comprising single-instruction multiple thread (SIMT) execution circuitry to simultaneously execute multiple threads, a shared local memory to be shared by the multiple threads, and scheduling hardware logic to schedule the multiple threads in a thread group for execution across the plurality of multiprocessors in accordance with barrier data. The instructions of the multiple threads are to produce shared data to be stored in the shared local memory when executed by the plurality of multiprocessors, wherein additional instructions of at least a first thread of the multiple threads are to use the shared data, and wherein, in accordance with the barrier data, the first thread is to wait for other threads of the multiple threads to finish producing the shared data before executing the additional instructions.

RELATED APPLICATION

This Application is a continuation of and claims the benefit of andpriority to U.S. application Ser. No. 17/848,559, filed Jun. 24, 2022,which is a continuation of U.S. application Ser. No. 17/173,923,entitled SCHEDULING OF THREADS FOR EXECUTION UTILIZING LOAD BALANCING OFTHREAD GROUPS, by Balaji Vembu, et al., filed Feb. 11, 2021, now issuedas U.S. Pat. No. 11,397,585, which is a continuation of and claims thebenefit of and priority to U.S. application Ser. No. 16/825,129,entitled SCHEDULING OF THREADS FOR EXECUTION UTILIZING LOAD BALANCING OFTHREAD GROUPS, by Balaji Vembu, et al., filed Mar. 20, 2020, now issuedas U.S. Pat. No. 10,922,085, which is a continuation of and claims thebenefit of and priority to U.S. application Ser. No. 16/388,444,entitled SCHEDULING OF THREADS FOR EXECUTION UTILIZING BARRIER USAGEDATA, by Balaji Vembu, et al., filed Apr. 18, 2019, now issued as U.S.Pat. No. 10,599,438, which is a continuation of and claims the benefitof and priority to U.S. application Ser. No. 15/477,017, entitled AMECHANISM FOR SCHEDULING THREADS ON A MULTIPROCESSOR, by Balaji Vembu,et al., filed Apr. 1, 2017, now issued as U.S. Pat. No. 10,310,861 theentire contents of which are incorporated herein by reference.

FIELD

Embodiments relate generally to data processing and more particularly todata processing via a general-purpose graphics processing unit.

BACKGROUND OF THE DESCRIPTION

Current parallel graphics data processing includes systems and methodsdeveloped to perform specific operations on graphics data such as, forexample, linear interpolation, tessellation, rasterization, texturemapping, depth testing, etc. Traditionally, graphics processors usedfixed function computational units to process graphics data. However,more recently, portions of graphics processors have been madeprogrammable, enabling such processors to support a wider variety ofoperations for processing vertex and fragment data.

To further increase performance, graphics processors typically implementprocessing techniques such as pipelining that attempt to process, inparallel, as much graphics data as possible throughout the differentparts of the graphics pipeline. Parallel graphics processors with singleinstruction, multiple thread (SIMT) architectures are designed tomaximize the amount of parallel processing in the graphics pipeline. Inan SIMT architecture, groups of parallel threads attempt to executeprogram instructions synchronously together as often as possible toincrease processing efficiency. A general overview of software andhardware for SIMT architectures can be found in Shane Cook, CUDAProgramming Chapter 3, pages 37-51 (2013).

A graphics processor typically includes a thread scheduler to dispatchthe threads to one of several multiprocessors within the processor.Thus, the thread scheduler attempts to load threads per multiprocessorto determine whether to dispatch threads to a particular multiprocessorin order to load-balance the threads across the multiprocessors.However, this can lead to excessive cross-multiprocessor synchronizationoverhead for thread groups that heavily use barrier synchronization,which ultimately results in reduced performance.

BRIEF DESCRIPTION OF THE DRAWINGS

Embodiments are illustrated by way of example and not limitation in thefigures of the accompanying drawings in which like references indicatesimilar elements, and in which:

FIG. 1 is a block diagram illustrating a computer system configured toimplement one or more aspects of the embodiments described herein;

FIG. 2A-2D illustrate parallel processor components, according to anembodiment;

FIGS. 3A-3B are block diagrams of graphics multiprocessors, according toembodiments;

FIGS. 4A-4F illustrate an exemplary architecture in which a plurality ofGPUs is communicatively coupled to a plurality of multi-core processors;

FIG. 5 illustrates a graphics processing pipeline, according to anembodiment;

FIG. 6 illustrates a computing device employing a scheduling mechanism,according to an embodiment;

FIG. 7 is a flow diagram illustrating one embodiment of a process toimplement a scheduling mechanism;

FIG. 8 is a block diagram of a processing system, according to anembodiment;

FIG. 9 is a block diagram of a processor according to an embodiment;

FIG. 10 is a block diagram of a graphics processor, according to anembodiment;

FIG. 11 is a block diagram of a graphics processing engine of a graphicsprocessor in accordance with some embodiments;

FIG. 12 is a block diagram of a graphics processor provided by anadditional embodiment;

FIG. 13 illustrates thread execution logic including an array ofprocessing elements employed in some embodiments;

FIG. 14 is a block diagram illustrating graphics processor instructionformats according to some embodiments;

FIG. 15 is a block diagram of a graphics processor according to anotherembodiment;

FIG. 16A-16B illustrate a graphics processor command format and commandsequence, according to some embodiments;

FIG. 17 illustrates exemplary graphics software architecture for a dataprocessing system according to some embodiments;

FIG. 18 is a block diagram illustrating an IP core development system,according to an embodiment;

FIG. 19 is a block diagram illustrating an exemplary system on a chipintegrated circuit, according to an embodiment;

FIG. 20 is a block diagram illustrating an additional exemplary graphicsprocessor; and

FIG. 21 is a block diagram illustrating an additional exemplary graphicsprocessor of a system on a chip integrated circuit, according to anembodiment.

DETAILED DESCRIPTION

In some embodiments, a scheduling mechanism is disclosed that accountsfor barrier usage during scheduling of a thread group during acrossmultiprocessors within a graphics processor. In such an embodiment, athread policy is implemented that provides a weight values based on theuse of barriers in a thread group, in addition to conventional loadbalancing across the multiprocessors. In a further embodiment, a threadscheduler within the graphics processor attempts to schedule all of thethreads in the thread group to the same multiprocessor upon adetermination that there is high thread usage within a thread group.Thus, cross-multiprocessor barrier overhead is minimized.

In the following description, numerous specific details are set forth toprovide a more thorough understanding. However, it will be apparent toone of skill in the art that the embodiments described herein may bepracticed without one or more of these specific details. In otherinstances, well-known features have not been described to avoidobscuring the details of the present embodiments.

System Overview

FIG. 1 is a block diagram illustrating a computing system 100 configuredto implement one or more aspects of the embodiments described herein.The computing system 100 includes a processing subsystem 101 having oneor more processor(s) 102 and a system memory 104 communicating via aninterconnection path that may include a memory hub 105. The memory hub105 may be a separate component within a chipset component or may beintegrated within the one or more processor(s) 102. The memory hub 105couples with an I/O subsystem 111 via a communication link 106. The I/Osubsystem 111 includes an I/O hub 107 that can enable the computingsystem 100 to receive input from one or more input device(s) 108.Additionally, the I/O hub 107 can enable a display controller, which maybe included in the one or more processor(s) 102, to provide outputs toone or more display device(s) 110A. In one embodiment, the one or moredisplay device(s) 110A coupled with the I/O hub 107 can include a local,internal, or embedded display device.

In one embodiment, the processing subsystem 101 includes one or moreparallel processor(s) 112 coupled to memory hub 105 via a bus or othercommunication link 113. The communication link 113 may be one of anynumber of standards based communication link technologies or protocols,such as, but not limited to PCI Express, or may be a vendor specificcommunications interface or communications fabric. In one embodiment,the one or more parallel processor(s) 112 form a computationally focusedparallel or vector processing system that an include a large number ofprocessing cores and/or processing clusters, such as a many integratedcore (MIC) processor. In one embodiment, the one or more parallelprocessor(s) 112 form a graphics processing subsystem that can outputpixels to one of the one or more display device(s) 110A coupled via theI/O hub 107. The one or more parallel processor(s) 112 can also includea display controller and display interface (not shown) to enable adirect connection to one or more display device(s) 110B.

Within the I/O subsystem 111, a system storage unit 114 can connect tothe I/O hub 107 to provide a storage mechanism for the computing system100. An I/O switch 116 can be used to provide an interface mechanism toenable connections between the I/O hub 107 and other components, such asa network adapter 118 and/or wireless network adapter 119 that may beintegrated into the platform, and various other devices that can beadded via one or more add-in device(s) 120. The network adapter 118 canbe an Ethernet adapter or another wired network adapter. The wirelessnetwork adapter 119 can include one or more of a Wi-Fi, Bluetooth, nearfield communication (NFC), or other network device that includes one ormore wireless radios.

The computing system 100 can include other components not explicitlyshown, including USB or other port connections, optical storage drives,video capture devices, and the like, may also be connected to the I/Ohub 107. Communication paths interconnecting the various components inFIG. 1 may be implemented using any suitable protocols, such as PCI(Peripheral Component Interconnect) based protocols (e.g., PCI-Express),or any other bus or point-to-point communication interfaces and/orprotocol(s), such as the NV-Link high-speed interconnect, orinterconnect protocols known in the art.

In one embodiment, the one or more parallel processor(s) 112 incorporatecircuitry optimized for graphics and video processing, including, forexample, video output circuitry, and constitutes a graphics processingunit (GPU). In another embodiment, the one or more parallel processor(s)112 incorporate circuitry optimized for general purpose processing,while preserving the underlying computational architecture, described ingreater detail herein. In yet another embodiment, components of thecomputing system 100 may be integrated with one or more other systemelements on a single integrated circuit. For example, the one or moreparallel processor(s), 112 memory hub 105, processor(s) 102, and I/O hub107 can be integrated into a system on chip (SoC) integrated circuit.Alternatively, the components of the computing system 100 can beintegrated into a single package to form a system in package (SIP)configuration. In one embodiment, at least a portion of the componentsof the computing system 100 can be integrated into a multi-chip module(MCM), which can be interconnected with other multi-chip modules into amodular computing system.

It will be appreciated that the computing system 100 shown herein isillustrative and that variations and modifications are possible. Theconnection topology, including the number and arrangement of bridges,the number of processor(s) 102, and the number of parallel processor(s)112, may be modified as desired. For instance, in some embodiments,system memory 104 is connected to the processor(s) 102 directly ratherthan through a bridge, while other devices communicate with systemmemory 104 via the memory hub 105 and the processor(s) 102. In otheralternative topologies, the parallel processor(s) 112 are connected tothe I/O hub 107 or directly to one of the one or more processor(s) 102,rather than to the memory hub 105. In other embodiments, the I/O hub 107and memory hub 105 may be integrated into a single chip. Someembodiments may include two or more sets of processor(s) 102 attachedvia multiple sockets, which can couple with two or more instances of theparallel processor(s) 112.

Some of the particular components shown herein are optional and may notbe included in all implementations of the computing system 100. Forexample, any number of add-in cards or peripherals may be supported, orsome components may be eliminated. Furthermore, some architectures mayuse different terminology for components similar to those illustrated inFIG. 1 . For example, the memory hub 105 may be referred to as aNorthbridge in some architectures, while the I/O hub 107 may be referredto as a Southbridge.

FIG. 2A illustrates a parallel processor 200, according to anembodiment. The various components of the parallel processor 200 may beimplemented using one or more integrated circuit devices, such asprogrammable processors, application specific integrated circuits(ASICs), or field programmable gate arrays (FPGA). The illustratedparallel processor 200 is a variant of the one or more parallelprocessor(s) 112 shown in FIG. 1 , according to an embodiment.

In one embodiment, the parallel processor 200 includes a parallelprocessing unit 202. The parallel processing unit includes an I/O unit204 that enables communication with other devices, including otherinstances of the parallel processing unit 202. The I/O unit 204 may bedirectly connected to other devices. In one embodiment, the I/O unit 204connects with other devices via the use of a hub or switch interface,such as memory hub 105. The connections between the memory hub 105 andthe I/O unit 204 form a communication link 113. Within the parallelprocessing unit 202, the I/O unit 204 connects with a host interface 206and a memory crossbar 216, where the host interface 206 receivescommands directed to performing processing operations and the memorycrossbar 216 receives commands directed to performing memory operations.

When the host interface 206 receives a command buffer via the I/O unit204, the host interface 206 can direct work operations to perform thosecommands to a front end 208. In one embodiment, the front end 208couples with a scheduler 210, which is configured to distribute commandsor other work items to a processing cluster array 212. In oneembodiment, the scheduler 210 ensures that the processing cluster array212 is properly configured and in a valid state before tasks aredistributed to the processing clusters of the processing cluster array212.

The processing cluster array 212 can include up to “N” processingclusters (e.g., cluster 214A, cluster 214B, through cluster 214N). Eachcluster 214A-214N of the processing cluster array 212 can execute alarge number of concurrent threads. The scheduler 210 can allocate workto the clusters 214A-214N of the processing cluster array 212 usingvarious scheduling and/or work distribution algorithms, which may varydepending on the workload arising for each type of program orcomputation. The scheduling can be handled dynamically by the scheduler210 or can be assisted in part by compiler logic during compilation ofprogram logic configured for execution by the processing cluster array212.

In one embodiment, different clusters 214A-214N of the processingcluster array 212 can be allocated for processing different types ofprograms or for performing different types of computations.

The processing cluster array 212 can be configured to perform varioustypes of parallel processing operations. In one embodiment, theprocessing cluster array 212 is configured to perform general-purposeparallel compute operations. For example, the processing cluster array212 can include logic to execute processing tasks including filtering ofvideo and/or audio data, and/or modeling operations, including physicsoperations, and performing data transformations.

In one embodiment, the processing cluster array 212 is configured toperform parallel graphics processing operations. In embodiments in whichthe parallel processor 200 is configured to perform graphics processingoperations, the processing cluster array 212 can include additionallogic to support the execution of such graphics processing operations,including, but not limited to texture sampling logic to perform textureoperations, as well as tessellation logic and other vertex processinglogic. Additionally, the processing cluster array 212 can be configuredto execute graphics processing related shader programs such as, but notlimited to vertex shaders, tessellation shaders, geometry shaders, andpixel shaders. The parallel processing unit 202 can transfer data fromsystem memory via the I/O unit 204 for processing. During processing thetransferred data can be stored to on-chip memory (e.g., parallelprocessor memory 222) during processing, then written back to systemmemory.

In one embodiment, when the parallel processing unit 202 is used toperform graphics processing, the scheduler 210 can be configured todivide the processing workload into approximately equal sized tasks, tobetter enable distribution of the graphics processing operations tomultiple clusters 214A-214N of the processing cluster array 212. In someembodiments, portions of the processing cluster array 212 can beconfigured to perform different types of processing. For example, afirst portion may be configured to perform vertex shading and topologygeneration, a second portion may be configured to perform tessellationand geometry shading, and a third portion may be configured to performpixel shading or other screen space operations, to produce a renderedimage for display. Intermediate data produced by one or more of theclusters 214A-214N may be stored in buffers to allow the intermediatedata to be transmitted between clusters 214A-214N for furtherprocessing.

During operation, the processing cluster array 212 can receiveprocessing tasks to be executed via the scheduler 210, which receivescommands defining processing tasks from front end 208. For graphicsprocessing operations, processing tasks can include indices of data tobe processed, e.g., surface (patch) data, primitive data, vertex data,and/or pixel data, as well as state parameters and commands defining howthe data is to be processed (e.g., what program is to be executed). Thescheduler 210 may be configured to fetch the indices corresponding tothe tasks or may receive the indices from the front end 208. The frontend 208 can be configured to ensure the processing cluster array 212 isconfigured to a valid state before the workload specified by incomingcommand buffers (e.g., batch-buffers, push buffers, etc.) is initiated.

Each of the one or more instances of the parallel processing unit 202can couple with parallel processor memory 222. The parallel processormemory 222 can be accessed via the memory crossbar 216, which canreceive memory requests from the processing cluster array 212 as well asthe I/O unit 204. The memory crossbar 216 can access the parallelprocessor memory 222 via a memory interface 218. The memory interface218 can include multiple partition units (e.g., partition unit 220A,partition unit 220B, through partition unit 220N) that can each coupleto a portion (e.g., memory unit) of parallel processor memory 222. Inone implementation the number of partition units 220A-220N is configuredto be equal to the number of memory units, such that a first partitionunit 220A has a corresponding first memory unit 224A, a second partitionunit 220B has a corresponding memory unit 224B, and an Nth partitionunit 220N has a corresponding Nth memory unit 224N. In otherembodiments, the number of partition units 220A-220N may not be equal tothe number of memory devices.

In various embodiments, the memory units 224A-224N can include varioustypes of memory devices, including dynamic random access memory (DRAM)or graphics random access memory, such as synchronous graphics randomaccess memory (SGRAM), including graphics double data rate (GDDR)memory. In one embodiment, the memory units 224A-224N may also include3D stacked memory, including but not limited to high bandwidth memory(HBM). Persons skilled in the art will appreciate that the specificimplementation of the memory units 224A-224N can vary and can beselected from one of various conventional designs. Render targets, suchas frame buffers or texture maps may be stored across the memory units224A-224N, allowing partition units 220A-220N to write portions of eachrender target in parallel to efficiently use the available bandwidth ofparallel processor memory 222. In some embodiments, a local instance ofthe parallel processor memory 222 may be excluded in favor of a unifiedmemory design that utilizes system memory in conjunction with localcache memory.

In one embodiment, any one of the clusters 214A-214N of the processingcluster array 212 can process data that will be written to any of thememory units 224A-224N within parallel processor memory 222. The memorycrossbar 216 can be configured to transfer the output of each cluster214A-214N to any partition unit 220A-220N or to another cluster214A-214N, which can perform additional processing operations on theoutput. Each cluster 214A-214N can communicate with the memory interface218 through the memory crossbar 216 to read from or write to variousexternal memory devices. In one embodiment the memory crossbar 216 has aconnection to the memory interface 218 to communicate with the I/O unit204, as well as a connection to a local instance of the parallelprocessor memory 222, enabling the processing units within the differentprocessing clusters 214A-214N to communicate with system memory or othermemory that is not local to the parallel processing unit 202. In oneembodiment the memory crossbar 216 can use virtual channels to separatetraffic streams between the clusters 214A-214N and the partition units220A-220N.

While a single instance of the parallel processing unit 202 isillustrated within the parallel processor 200, any number of instancesof the parallel processing unit 202 can be included. For example,multiple instances of the parallel processing unit 202 can be providedon a single add-in card, or multiple add-in cards can be interconnected.The different instances of the parallel processing unit 202 can beconfigured to inter-operate even if the different instances havedifferent numbers of processing cores, different amounts of localparallel processor memory, and/or other configuration differences. Forexample, and in one embodiment, some instances of the parallelprocessing unit 202 can include higher precision floating point unitsrelative to other instances. Systems incorporating one or more instancesof the parallel processing unit 202 or the parallel processor 200 can beimplemented in a variety of configurations and form factors, includingbut not limited to desktop, laptop, or handheld personal computers,servers, workstations, game consoles, and/or embedded systems.

FIG. 2B is a block diagram of a partition unit 220, according to anembodiment. In one embodiment, the partition unit 220 is an instance ofone of the partition units 220A-220N of FIG. 2A. As illustrated, thepartition unit 220 includes an L2 cache 221, a frame buffer interface225, and a ROP 226 (raster operations unit). The L2 cache 221 is aread/write cache that is configured to perform load and store operationsreceived from the memory crossbar 216 and ROP 226. Read misses andurgent write-back requests are output by L2 cache 221 to frame bufferinterface 225 for processing. Dirty updates can also be sent to theframe buffer via the frame buffer interface 225 for opportunisticprocessing. In one embodiment, the frame buffer interface 225 interfaceswith one of the memory units in parallel processor memory, such as thememory units 224A-224N of FIG. 2A (e.g., within parallel processormemory 222).

In graphics applications, the ROP 226 is a processing unit that performsraster operations such as stencil, z test, blending, and the like. TheROP 226 then outputs processed graphics data that is stored in graphicsmemory. In some embodiments the ROP 226 includes compression logic tocompress z or color data that is written to memory and decompress z orcolor data that is read from memory. In some embodiments, the ROP 226 isincluded within each processing cluster (e.g., cluster 214A-214N of FIG.2 ) instead of within the partition unit 220. In such embodiment, readand write requests for pixel data are transmitted over the memorycrossbar 216 instead of pixel fragment data.

The processed graphics data may be displayed on display device, such asone of the one or more display device(s) 110A-110B of FIG. 1 , routedfor further processing by the processor(s) 102, or routed for furtherprocessing by one of the processing entities within the parallelprocessor 200 of FIG. 2A.

FIG. 2C is a block diagram of a processing cluster 214 within a parallelprocessing unit, according to an embodiment. In one embodiment, theprocessing cluster is an instance of one of the processing clusters214A-214N of FIG. 2A. The processing cluster 214 can be configured toexecute many threads in parallel, where the term “thread” refers to aninstance of a particular program executing on a particular set of inputdata. In some embodiments, single-instruction, multiple-data (SIMD)instruction issue techniques are used to support parallel execution of alarge number of threads without providing multiple independentinstruction units. In other embodiments, single-instruction,multiple-thread (SIMT) techniques are used to support parallel executionof a large number of generally synchronized threads, using a commoninstruction unit configured to issue instructions to a set of processingengines within each one of the processing clusters. Unlike a SIMDexecution regime, where all processing engines typically executeidentical instructions, SIMT execution allows different threads to morereadily follow divergent execution paths through a given thread program.Persons skilled in the art will understand that a SIMD processing regimerepresents a functional subset of a SIMT processing regime.

Operation of the processing cluster 214 can be controlled via a pipelinemanager 232 that distributes processing tasks to SIMT parallelprocessors. The pipeline manager 232 receives instructions from thescheduler 210 of FIG. 2A and manages execution of those instructions viaa graphics multiprocessor 234 and/or a texture unit 236. The illustratedgraphics multiprocessor 234 is an exemplary instance of an SIMT parallelprocessor. However, various types of SIMT parallel processors ofdiffering architectures may be included within the processing cluster214. One or more instances of the graphics multiprocessor 234 can beincluded within a processing cluster 214. The graphics multiprocessor234 can process data and a data crossbar 240 can be used to distributethe processed data to one of multiple possible destinations, includingother shader units. The pipeline manager 232 can facilitate thedistribution of processed data by specifying destinations for processeddata to be distributed via the data crossbar 240.

Each graphics multiprocessor 234 within the processing cluster 214 caninclude an identical set of functional execution logic (e.g., arithmeticlogic units, load-store units, etc.). The functional execution logic canbe configured in a pipelined manner in which new instructions can beissued before previous instructions are complete. The functionalexecution logic supports a variety of operations including integer andfloating point arithmetic, comparison operations, Boolean operations,bit-shifting, and computation of various algebraic functions. In oneembodiment the same functional-unit hardware can be leveraged to performdifferent operations and any combination of functional units may bepresent.

The instructions transmitted to the processing cluster 214 constitutes athread. A set of threads executing across the set of parallel processingengines is a thread group. A thread group executes the same program ondifferent input data. Each thread within a thread group can be assignedto a different processing engine within a graphics multiprocessor 234. Athread group may include fewer threads than the number of processingengines within the graphics multiprocessor 234. When a thread groupincludes fewer threads than the number of processing engines, one ormore of the processing engines may be idle during cycles in which thatthread group is being processed. A thread group may also include morethreads than the number of processing engines within the graphicsmultiprocessor 234. When the thread group includes more threads than thenumber of processing engines within the graphics multiprocessor 234,processing can be performed over consecutive clock cycles. In oneembodiment multiple thread groups can be executed concurrently on agraphics multiprocessor 234.

In one embodiment, the graphics multiprocessor 234 includes an internalcache memory to perform load and store operations. In one embodiment,the graphics multiprocessor 234 can forego an internal cache and use acache memory (e.g., L1 cache 248) within the processing cluster 214.Each graphics multiprocessor 234 also has access to L2 caches within thepartition units (e.g., partition units 220A-220N of FIG. 2A) that areshared among all processing clusters 214 and may be used to transferdata between threads. The graphics multiprocessor 234 may also accessoff-chip global memory, which can include one or more of local parallelprocessor memory and/or system memory. Any memory external to theparallel processing unit 202 may be used as global memory. Embodimentsin which the processing cluster 214 includes multiple instances of thegraphics multiprocessor 234 can share common instructions and data,which may be stored in the L1 cache 248.

Each processing cluster 214 may include an MMU 245 (memory managementunit) that is configured to map virtual addresses into physicaladdresses. In other embodiments, one or more instances of the MMU 245may reside within the memory interface 218 of FIG. 2A. The MMU 245includes a set of page table entries (PTEs) used to map a virtualaddress to a physical address of a tile and optionally a cache lineindex. The MMU 245 may include address translation lookaside buffers(TLB) or caches that may reside within the graphics multiprocessor 234or the L1 cache or processing cluster 214. The physical address isprocessed to distribute surface data access locality to allow efficientrequest interleaving among partition units. The cache line index may beused to determine whether a request for a cache line is a hit or miss.

In graphics and computing applications, a processing cluster 214 may beconfigured such that each graphics multiprocessor 234 is coupled to atexture unit 236 for performing texture mapping operations, e.g.,determining texture sample positions, reading texture data, andfiltering the texture data. Texture data is read from an internaltexture L1 cache (not shown) or in some embodiments from the L1 cachewithin graphics multiprocessor 234 and is fetched from an L2 cache,local parallel processor memory, or system memory, as needed. Eachgraphics multiprocessor 234 outputs processed tasks to the data crossbar240 to provide the processed task to another processing cluster 214 forfurther processing or to store the processed task in an L2 cache, localparallel processor memory, or system memory via the memory crossbar 216.A preROP 242 (pre-raster operations unit) is configured to receive datafrom graphics multiprocessor 234, direct data to ROP units, which may belocated with partition units as described herein (e.g., partition units220A-220N of FIG. 2A). The preROP 242 unit can perform optimizations forcolor blending, organize pixel color data, and perform addresstranslations.

It will be appreciated that the core architecture described herein isillustrative and that variations and modifications are possible. Anynumber of processing units, e.g., graphics multiprocessor 234, textureunits 236, preROPs 242, etc., may be included within a processingcluster 214. Further, while only one processing cluster 214 is shown, aparallel processing unit as described herein may include any number ofinstances of the processing cluster 214. In one embodiment, eachprocessing cluster 214 can be configured to operate independently ofother processing clusters 214 using separate and distinct processingunits, L1 caches, etc.

FIG. 2D shows a graphics multiprocessor 234, according to oneembodiment. In such embodiments, the graphics multiprocessor 234 coupleswith the pipeline manager 232 of the processing cluster 214. Thegraphics multiprocessor 234 has an execution pipeline including but notlimited to an instruction cache 252, an instruction unit 254, an addressmapping unit 256, a register file 258, one or more general purposegraphics processing unit (GPGPU) cores 262, and one or more load/storeunits 266. The GPGPU cores 262 and load/store units 266 are coupled withcache memory 272 and shared memory 270 via a memory and cacheinterconnect 268.

In one embodiment, the instruction cache 252 receives a stream ofinstructions to execute from the pipeline manager 232. The instructionsare cached in the instruction cache 252 and dispatched for execution bythe instruction unit 254. The instruction unit 254 can dispatchinstructions as thread groups (e.g., warps), with each thread of thethread group assigned to a different execution unit within GPGPU core262. An instruction can access any of a local, shared, or global addressspace by specifying an address within a unified address space. Theaddress mapping unit 256 can be used to translate addresses in theunified address space into a distinct memory address that can beaccessed by the load/store units 266.

The register file 258 provides a set of registers for the functionalunits of the graphics multiprocessor 234. The register file 258 providestemporary storage for operands connected to the data paths of thefunctional units (e.g., GPGPU cores 262, load/store units 266) of thegraphics multiprocessor 234. In one embodiment, the register file 258 isdivided between each of the functional units such that each functionalunit is allocated a dedicated portion of the register file 258. In oneembodiment, the register file 258 is divided between the different warpsbeing executed by the graphics multiprocessor 234.

The GPGPU cores 262 can each include floating point units (FPUs) and/orinteger arithmetic logic units (ALUs) that are used to executeinstructions of the graphics multiprocessor 234. The GPGPU cores 262 canbe similar in architecture or can differ in architecture, according toembodiments. For example, and in one embodiment, a first portion of theGPGPU cores 262 include a single precision FPU and an integer ALU whilea second portion of the GPGPU cores include a double precision FPU. Inone embodiment, the FPUs can implement the IEEE 754-2008 standard forfloating point arithmetic or enable variable precision floating pointarithmetic. The graphics multiprocessor 234 can additionally include oneor more fixed function or special function units to perform specificfunctions such as copy rectangle or pixel blending operations. In oneembodiment one or more of the GPGPU cores can also include fixed orspecial function logic.

The memory and cache interconnect 268 is an interconnect network thatconnects each of the functional units of the graphics multiprocessor 234to the register file 258 and to the shared memory 270. In oneembodiment, the memory and cache interconnect 268 is a crossbarinterconnect that allows the load/store unit 266 to implement load andstore operations between the shared memory 270 and the register file258. The register file 258 can operate at the same frequency as theGPGPU cores 262, thus data transfer between the GPGPU cores 262 and theregister file 258 is very low latency. The shared memory 270 can be usedto enable communication between threads that execute on the functionalunits within the graphics multiprocessor 234. The cache memory 272 canbe used as a data cache for example, to cache texture data communicatedbetween the functional units and the texture unit 236. The shared memory270 can also be used as a program managed cached. Threads executing onthe GPGPU cores 262 can programmatically store data within the sharedmemory in addition to the automatically cached data that is storedwithin the cache memory 272.

FIGS. 3A-3B illustrate additional graphics multiprocessors, according toembodiments. The illustrated graphics multiprocessors 325, 350 arevariants of the graphics multiprocessor 234 of FIG. 2C. The illustratedgraphics multiprocessors 325, 350 can be configured as a streamingmultiprocessor (SM) capable of simultaneous execution of a large numberof execution threads.

FIG. 3A shows a graphics multiprocessor 325 according to an additionalembodiment. The graphics multiprocessor 325 includes multiple additionalinstances of execution resource units relative to the graphicsmultiprocessor 234 of FIG. 2D. For example, the graphics multiprocessor325 can include multiple instances of the instruction unit 332A-332B,register file 334A-334B, and texture unit(s) 344A-344B. The graphicsmultiprocessor 325 also includes multiple sets of graphics or computeexecution units (e.g., GPGPU core 336A-336B, GPGPU core 337A-337B, GPGPUcore 338A-338B) and multiple sets of load/store units 340A-340B. In oneembodiment, the execution resource units have a common instruction cache330, texture and/or data cache memory 342, and shared memory 346. Thevarious components can communicate via an interconnect fabric 327. Inone embodiment, the interconnect fabric 327 includes one or morecrossbar switches to enable communication between the various componentsof the graphics multiprocessor 325.

FIG. 3B shows a graphics multiprocessor 350 according to an additionalembodiment. The graphics processor includes multiple sets of executionresources 356A-356D, where each set of execution resource includesmultiple instruction units, register files, GPGPU cores, and load storeunits, as illustrated in FIG. 2D and FIG. 3A. The execution resources356A-356D can work in concert with texture unit(s) 360A-360D for textureoperations, while sharing an instruction cache 354, and shared memory362. In one embodiment, the execution resources 356A-356D can share aninstruction cache 354 and shared memory 362, as well as multipleinstances of a texture and/or data cache memory 358A-358B. The variouscomponents can communicate via an interconnect fabric 352 similar to theinterconnect fabric 327 of FIG. 3A.

Persons skilled in the art will understand that the architecturedescribed in FIGS. 1, 2A-2D, and 3A-3B are descriptive and not limitingas to the scope of the present embodiments. Thus, the techniquesdescribed herein may be implemented on any properly configuredprocessing unit, including, without limitation, one or more mobileapplication processors, one or more desktop or server central processingunits (CPUs) including multi-core CPUs, one or more parallel processingunits, such as the parallel processing unit 202 of FIG. 2 , as well asone or more graphics processors or special purpose processing units,without departure from the scope of the embodiments described herein.

In some embodiments, a parallel processor or GPGPU as described hereinis communicatively coupled to host/processor cores to accelerategraphics operations, machine-learning operations, pattern analysisoperations, and various general purpose GPU (GPGPU) functions. The GPUmay be communicatively coupled to the host processor/cores over a bus orother interconnect (e.g., a high-speed interconnect such as PCIe orNVLink). In other embodiments, the GPU may be integrated on the samepackage or chip as the cores and communicatively coupled to the coresover an internal processor bus/interconnect (i.e., internal to thepackage or chip). Regardless of the manner in which the GPU isconnected, the processor cores may allocate work to the GPU in the formof sequences of commands/instructions contained in a work descriptor.The GPU then uses dedicated circuitry/logic for efficiently processingthese commands/instructions.

Techniques for GPU to Host Processor Interconnection

FIG. 4A illustrates an exemplary architecture in which a plurality ofGPUs 410-413 is communicatively coupled to a plurality of multi-coreprocessors 405-406 over high-speed links 440A-440D (e.g., buses,point-to-point interconnects, etc.). In one embodiment, the high-speedlinks 440A-440D support a communication throughput of 4 GB/s, 30 GB/s,80 GB/s or higher, depending on the implementation. Various interconnectprotocols may be used including, but not limited to, PCIe 4.0 or 5.0 andNVLink 2.0. However, the underlying principles of the invention are notlimited to any particular communication protocol or throughput.

In addition, in one embodiment, two or more of the GPUs 410-413 areinterconnected over high-speed links 442A-442B, which may be implementedusing the same or different protocols/links than those used forhigh-speed links 440A-440D. Similarly, two or more of the multi-coreprocessors 405-406 may be connected over high speed link 433 which maybe symmetric multi-processor (SMP) buses operating at 20 GB/s, 30 GB/s,120 GB/s or higher. Alternatively, all communication between the varioussystem components shown in FIG. 4A may be accomplished using the sameprotocols/links (e.g., over a common interconnection fabric). Asmentioned, however, the underlying principles of the invention are notlimited to any particular type of interconnect technology.

In one embodiment, each multi-core processor 405-406 is communicativelycoupled to a processor memory 401-402, via memory interconnects430A-430B, respectively, and each GPU 410-413 is communicatively coupledto GPU memory 420-423 over GPU memory interconnects 450-453,respectively. The memory interconnects 430A-430B and 450-453 may utilizethe same or different memory access technologies. By way of example, andnot limitation, the processor memories 401-402 and GPU memories 420-423may be volatile memories such as dynamic random access memories (DRAMs)(including stacked DRAMs), Graphics DDR SDRAM (GDDR) (e.g., GDDR5,GDDR6), or High Bandwidth Memory (HBM) and/or may be non-volatilememories such as 3D XPoint or Nano-Ram. In one embodiment, some portionof the memories may be volatile memory and another portion may benon-volatile memory (e.g., using a two-level memory (2LM) hierarchy).

As described below, although the various processors 405-406 and GPUs410-413 may be physically coupled to a particular memory 401-402,420-423, respectively, a unified memory architecture may be implementedin which the same virtual system address space (also referred to as the“effective address” space) is distributed among all of the variousphysical memories. For example, processor memories 401-402 may eachcomprise 64 GB of the system memory address space and GPU memories420-423 may each comprise 32 GB of the system memory address space(resulting in a total of 256 GB addressable memory in this example).

FIG. 4B illustrates additional details for an interconnection between amulti-core processor 407 and a graphics acceleration module 446 inaccordance with one embodiment. The graphics acceleration module 446 mayinclude one or more GPU chips integrated on a line card which is coupledto the processor 407 via the high-speed link 440. Alternatively, thegraphics acceleration module 446 may be integrated on the same packageor chip as the processor 407.

The illustrated processor 407 includes a plurality of cores 460A-460D,each with a translation lookaside buffer 461A-461D and one or morecaches 462A-462D. The cores may include various other components forexecuting instructions and processing data which are not illustrated toavoid obscuring the underlying principles of the invention (e.g.,instruction fetch units, branch prediction units, decoders, executionunits, reorder buffers, etc.). The caches 462A-462D may comprise level 1(L1) and level 2 (L2) caches. In addition, one or more shared caches 456may be included in the caching hierarchy and shared by sets of the cores460A-460D. For example, one embodiment of the processor 407 includes 24cores, each with its own L1 cache, twelve shared L2 caches, and twelveshared L3 caches. In this embodiment, one of the L2 and L3 caches areshared by two adjacent cores. The processor 407 and the graphicsaccelerator integration module 446 connect with system memory 441, whichmay include processor memories 401-402.

Coherency is maintained for data and instructions stored in the variouscaches 462A-462D, 456 and system memory 441 via inter-core communicationover a coherence bus 464. For example, each cache may have cachecoherency logic/circuitry associated therewith to communicate to overthe coherence bus 464 in response to detected reads or writes toparticular cache lines. In one implementation, a cache snooping protocolis implemented over the coherence bus 464 to snoop cache accesses. Cachesnooping/coherency techniques are well understood by those of skill inthe art and will not be described in detail here to avoid obscuring theunderlying principles of the invention.

In one embodiment, a proxy circuit 425 communicatively couples thegraphics acceleration module 446 to the coherence bus 464, allowing thegraphics acceleration module 446 to participate in the cache coherenceprotocol as a peer of the cores. In particular, an interface 435provides connectivity to the proxy circuit 425 over high-speed link 440(e.g., a PCIe bus, NVLink, etc.) and an interface 437 connects thegraphics acceleration module 446 to the high-speed link 440.

In one implementation, an accelerator integration circuit 436 providescache management, memory access, context management, and interruptmanagement services on behalf of a plurality of graphics processingengines 431, 432, N of the graphics acceleration module 446. Thegraphics processing engines 431, 432, N may each comprise a separategraphics processing unit (GPU). Alternatively, the graphics processingengines 431, 432, N may comprise different types of graphics processingengines within a GPU such as graphics execution units, media processingengines (e.g., video encoders/decoders), samplers, and blit engines. Inother words, the graphics acceleration module may be a GPU with aplurality of graphics processing engines 431-432, N or the graphicsprocessing engines 431-432, N may be individual GPUs integrated on acommon package, line card, or chip.

In one embodiment, the accelerator integration circuit 436 includes amemory management unit (MMU) 439 for performing various memorymanagement functions such as virtual-to-physical memory translations(also referred to as effective-to-real memory translations) and memoryaccess protocols for accessing system memory 441. The MMU 439 may alsoinclude a translation lookaside buffer (TLB) (not shown) for caching thevirtual/effective to physical/real address translations. In oneimplementation, a cache 438 stores commands and data for efficientaccess by the graphics processing engines 431-432, N. In one embodiment,the data stored in cache 438 and graphics memories 433-434, M is keptcoherent with the core caches 462A-462D, 456 and system memory 411. Asmentioned, this may be accomplished via proxy circuit 425 which takespart in the cache coherency mechanism on behalf of cache 438 andmemories 433-434, M (e.g., sending updates to the cache 438 related tomodifications/accesses of cache lines on processor caches 462A-462D, 456and receiving updates from the cache 438).

A set of registers 445 store context data for threads executed by thegraphics processing engines 431-432, N and a context management circuit448 manages the thread contexts. For example, the context managementcircuit 448 may perform save and restore operations to save and restorecontexts of the various threads during contexts switches (e.g., where afirst thread is saved and a second thread is stored so that the secondthread can be execute by a graphics processing engine). For example, ona context switch, the context management circuit 448 may store currentregister values to a designated region in memory (e.g., identified by acontext pointer). It may then restore the register values when returningto the context. In one embodiment, an interrupt management circuit 447receives and processes interrupts received from system devices.

In one implementation, virtual/effective addresses from a graphicsprocessing engine 431 are translated to real/physical addresses insystem memory 411 by the MMU 439. One embodiment of the acceleratorintegration circuit 436 supports multiple (e.g., 4, 8, 16) graphicsaccelerator modules 446 and/or other accelerator devices. The graphicsaccelerator module 446 may be dedicated to a single application executedon the processor 407 or may be shared between multiple applications. Inone embodiment, a virtualized graphics execution environment ispresented in which the resources of the graphics processing engines431-432, N are shared with multiple applications or virtual machines(VMs). The resources may be subdivided into “slices” which are allocatedto different VMs and/or applications based on the processingrequirements and priorities associated with the VMs and/or applications.

Thus, the accelerator integration circuit acts as a bridge to the systemfor the graphics acceleration module 446 and provides addresstranslation and system memory cache services. In addition, theaccelerator integration circuit 436 may provide virtualizationfacilities for the host processor to manage virtualization of thegraphics processing engines, interrupts, and memory management.

Because hardware resources of the graphics processing engines 431-432, Nare mapped explicitly to the real address space seen by the hostprocessor 407, any host processor can address these resources directlyusing an effective address value. One function of the acceleratorintegration circuit 436, in one embodiment, is the physical separationof the graphics processing engines 431-432, N so that they appear to thesystem as independent units.

As mentioned, in the illustrated embodiment, one or more graphicsmemories 433-434, M are coupled to each of the graphics processingengines 431-432, N, respectively. The graphics memories 433-434, M storeinstructions and data being processed by each of the graphics processingengines 431-432, N. The graphics memories 433-434, M may be volatilememories such as DRAMs (including stacked DRAMs), GDDR memory (e.g.,GDDR5, GDDR6), or HBM, and/or may be non-volatile memories such as 3DXPoint or Nano-Ram.

In one embodiment, to reduce data traffic over the high-speed link 440,biasing techniques are used to ensure that the data stored in graphicsmemories 433-434, M is data which will be used most frequently by thegraphics processing engines 431-432, N and preferably not used by thecores 460A-460D (at least not frequently). Similarly, the biasingmechanism attempts to keep data needed by the cores (and preferably notthe graphics processing engines 431-432, N) within the caches 462A-462D,456 of the cores and system memory 411.

FIG. 4C illustrates another embodiment in which the acceleratorintegration circuit 436 is integrated within the processor 407. In thisembodiment, the graphics processing engines 431-432, N communicatedirectly over the high-speed link 440 to the accelerator integrationcircuit 436 via interface 437 and interface 435 (which, again, may beutilize any form of bus or interface protocol). The acceleratorintegration circuit 436 may perform the same operations as thosedescribed with respect to FIG. 4B, but potentially at a higherthroughput given its close proximity to the coherence bus 464 and caches462A-462D, 456.

One embodiment supports different programming models including adedicated-process programming model (no graphics acceleration modulevirtualization) and shared programming models (with virtualization). Thelatter may include programming models which are controlled by theaccelerator integration circuit 436 and programming models which arecontrolled by the graphics acceleration module 446.

In one embodiment of the dedicated process model, graphics processingengines 431-432, N are dedicated to a single application or processunder a single operating system. The single application can funnel otherapplication requests to the graphics engines 431-432, N, providingvirtualization within a VM/partition.

In the dedicated-process programming models, the graphics processingengines 431-432, N, may be shared by multiple VM/application partitions.The shared models require a system hypervisor to virtualize the graphicsprocessing engines 431-432, N to allow access by each operating system.For single-partition systems without a hypervisor, the graphicsprocessing engines 431-432, N are owned by the operating system. In bothcases, the operating system can virtualize the graphics processingengines 431-432, N to provide access to each process or application.

For the shared programming model, the graphics acceleration module 446or an individual graphics processing engine 431-432, N selects a processelement using a process handle. In one embodiment, process elements arestored in system memory 411 and are addressable using the effectiveaddress to real address translation techniques described herein. Theprocess handle may be an implementation-specific value provided to thehost process when registering its context with the graphics processingengine 431-432, N (that is, calling system software to add the processelement to the process element linked list). The lower 16-bits of theprocess handle may be the offset of the process element within theprocess element linked list.

FIG. 4D illustrates an exemplary accelerator integration slice 490. Asused herein, a “slice” comprises a specified portion of the processingresources of the accelerator integration circuit 436. Applicationeffective address space 482 within system memory 411 stores processelements 483. In one embodiment, the process elements 483 are stored inresponse to GPU invocations 481 from applications 480 executed on theprocessor 407. A process element 483 contains the process state for thecorresponding application 480. A work descriptor (WD) 484 contained inthe process element 483 can be a single job requested by an applicationor may contain a pointer to a queue of jobs. In the latter case, the WD484 is a pointer to the job request queue in the application's addressspace 482.

The graphics acceleration module 446 and/or the individual graphicsprocessing engines 431-432, N can be shared by all or a subset of theprocesses in the system. Embodiments of the invention include aninfrastructure for setting up the process state and sending a WD 484 toa graphics acceleration module 446 to start a job in a virtualizedenvironment.

In one implementation, the dedicated-process programming model isimplementation-specific. In this model, a single process owns thegraphics acceleration module 446 or an individual graphics processingengine 431. Because the graphics acceleration module 446 is owned by asingle process, the hypervisor initializes the accelerator integrationcircuit 436 for the owning partition and the operating systeminitializes the accelerator integration circuit 436 for the owningprocess at the time when the graphics acceleration module 446 isassigned.

In operation, a WD fetch unit 491 in the accelerator integration slice490 fetches the next WD 484 which includes an indication of the work tobe done by one of the graphics processing engines of the graphicsacceleration module 446. Data from the WD 484 may be stored in registers445 and used by the MMU 439, interrupt management circuit 447 and/orcontext management circuit 448 as illustrated. For example, oneembodiment of the MMU 439 includes segment/page walk circuitry foraccessing segment/page tables 486 within the OS virtual address space485. The interrupt management circuit 447 may process interrupt events492 received from the graphics acceleration module 446. When performinggraphics operations, an effective address 493 generated by a graphicsprocessing engine 431-432, N is translated to a real address by the MMU439.

In one embodiment, the same set of registers 445 are duplicated for eachgraphics processing engine 431-432, N and/or graphics accelerationmodule 446 and may be initialized by the hypervisor or operating system.Each of these duplicated registers may be included in an acceleratorintegration slice 490. Exemplary registers that may be initialized bythe hypervisor are shown in Table 1.

TABLE 1 Hypervisor Initialized Registers 1 Slice Control Register 2 RealAddress (RA) Scheduled Processes Area Pointer 3 Authority Mask OverrideRegister 4 Interrupt Vector Table Entry Offset 5 Interrupt Vector TableEntry Limit 6 State Register 7 Logical Partition ID 8 Real address (RA)Hypervisor Accelerator Utilization Record Pointer 9 Storage DescriptionRegister

Exemplary registers that may be initialized by the operating system areshown in Table 2.

TABLE 2 Operating System Initialized Registers 1 Process and ThreadIdentification 2 Effective Address (EA) Context Save/Restore Pointer 3Virtual Address (VA) Accelerator Utilization Record Pointer 4 VirtualAddress (VA) Storage Segment Table Pointer 5 Authority Mask 6 Workdescriptor

In one embodiment, each WD 484 is specific to a particular graphicsacceleration module 446 and/or graphics processing engine 431-432, N. Itcontains all the information a graphics processing engine 431-432, Nrequires to do its work or it can be a pointer to a memory locationwhere the application has set up a command queue of work to becompleted.

FIG. 4E illustrates additional details for one embodiment of a sharedmodel. This embodiment includes a hypervisor real address space 498 inwhich a process element list 499 is stored. The hypervisor real addressspace 498 is accessible via a hypervisor 496 which virtualizes thegraphics acceleration module engines for the operating system 495.

The shared programming models allow for all or a subset of processesfrom all or a subset of partitions in the system to use a graphicsacceleration module 446. There are two programming models where thegraphics acceleration module 446 is shared by multiple processes andpartitions: time-sliced shared and graphics directed shared.

In this model, the system hypervisor 496 owns the graphics accelerationmodule 446 and makes its function available to all operating systems495. For a graphics acceleration module 446 to support virtualization bythe system hypervisor 496, the graphics acceleration module 446 mayadhere to the following requirements: 1) An application's job requestmust be autonomous (that is, the state does not need to be maintainedbetween jobs), or the graphics acceleration module 446 must provide acontext save and restore mechanism. 2) An application's job request isguaranteed by the graphics acceleration module 446 to complete in aspecified amount of time, including any translation faults, or thegraphics acceleration module 446 provides the ability to preempt theprocessing of the job. 3) The graphics acceleration module 446 must beguaranteed fairness between processes when operating in the directedshared programming model.

In one embodiment, for the shared model, the application 480 is requiredto make an operating system 495 system call with a graphics accelerationmodule 446 type, a work descriptor (WD), an authority mask register(AMR) value, and a context save/restore area pointer (CSRP). Thegraphics acceleration module 446 type describes the targetedacceleration function for the system call. The graphics accelerationmodule 446 type may be a system-specific value. The WD is formattedspecifically for the graphics acceleration module 446 and can be in theform of a graphics acceleration module 446 command, an effective addresspointer to a user-defined structure, an effective address pointer to aqueue of commands, or any other data structure to describe the work tobe done by the graphics acceleration module 446. In one embodiment, theAMR value is the AMR state to use for the current process. The valuepassed to the operating system is similar to an application setting theAMR. If the accelerator integration circuit 436 and graphicsacceleration module 446 implementations do not support a User AuthorityMask Override Register (UAMOR), the operating system may apply thecurrent UAMOR value to the AMR value before passing the AMR in thehypervisor call. The hypervisor 496 may optionally apply the currentAuthority Mask Override Register (AMOR) value before placing the AMRinto the process element 483. In one embodiment, the CSRP is one of theregisters 445 containing the effective address of an area in theapplication's address space 482 for the graphics acceleration module 446to save and restore the context state. This pointer is optional if nostate is required to be saved between jobs or when a job is preempted.The context save/restore area may be pinned system memory.

Upon receiving the system call, the operating system 495 may verify thatthe application 480 has registered and been given the authority to usethe graphics acceleration module 446. The operating system 495 thencalls the hypervisor 496 with the information shown in Table 3.

TABLE 3 OS to Hypervisor Call Parameters 1 A work descriptor (WD) 2 AnAuthority Mask Register (AMR) value (potentially masked). 3 An effectiveaddress (EA) Context Save/Restore Area Pointer (CSRP) 4 A process ID(PID) and optional thread ID (TID) 5 A virtual address (VA) acceleratorutilization record pointer (AURP) 6 The virtual address of the storagesegment table pointer (SSTP) 7 A logical interrupt service number (LISN)

Upon receiving the hypervisor call, the hypervisor 496 verifies that theoperating system 495 has registered and been given the authority to usethe graphics acceleration module 446. The hypervisor 496 then puts theprocess element 483 into the process element linked list for thecorresponding graphics acceleration module 446 type. The process elementmay include the information shown in Table 4.

TABLE 4 Process Element Information 1 A work descriptor (WD) 2 AnAuthority Mask Register (AMR) value (potentially masked). 3 An effectiveaddress (EA) Context Save/Restore Area Pointer (CSRP) 4 A process ID(PID) and optional thread ID (TID) 5 A virtual address (VA) acceleratorutilization record pointer (AURP) 6 The virtual address of the storagesegment table pointer (SSTP) 7 A logical interrupt service number (LISN)8 Interrupt vector table, derived from the hypervisor call parameters. 9A state register (SR) value 10 A logical partition ID (LPID) 11 A realaddress (RA) hypervisor accelerator utilization record pointer 12 TheStorage Descriptor Register (SDR)

In one embodiment, the hypervisor initializes a plurality of acceleratorintegration slice 490 registers 445.

As illustrated in FIG. 4F, one embodiment of the invention employs aunified memory addressable via a common virtual memory address spaceused to access the physical processor memories 401-402 and GPU memories420-423. In this implementation, operations executed on the GPUs 410-413utilize the same virtual/effective memory address space to access theprocessors memories 401-402 and vice versa, thereby simplifyingprogrammability. In one embodiment, a first portion of thevirtual/effective address space is allocated to the processor memory401, a second portion to the second processor memory 402, a thirdportion to the GPU memory 420, and so on. The entire virtual/effectivememory space (sometimes referred to as the effective address space) isthereby distributed across each of the processor memories 401-402 andGPU memories 420-423, allowing any processor or GPU to access anyphysical memory with a virtual address mapped to that memory.

In one embodiment, bias/coherence management circuitry 494A-494E withinone or more of the MMUs 439A-439E ensures cache coherence between thecaches of the host processors (e.g., 405) and the GPUs 410-413 andimplements biasing techniques indicating the physical memories in whichcertain types of data should be stored. While multiple instances ofbias/coherence management circuitry 494A-494E are illustrated in FIG.4F, the bias/coherence circuitry may be implemented within the MMU ofone or more host processors 405 and/or within the acceleratorintegration circuit 436.

One embodiment allows GPU-attached memory 420-423 to be mapped as partof system memory and accessed using shared virtual memory (SVM)technology, but without suffering the typical performance drawbacksassociated with full system cache coherence. The ability to GPU-attachedmemory 420-423 to be accessed as system memory without onerous cachecoherence overhead provides a beneficial operating environment for GPUoffload. This arrangement allows the host processor 405 software tosetup operands and access computation results, without the overhead oftradition I/O DMA data copies. Such traditional copies involve drivercalls, interrupts and memory mapped I/O (MMIO) accesses that are allinefficient relative to simple memory accesses. At the same time, theability to access GPU attached memory 420-423 without cache coherenceoverheads can be critical to the execution time of an offloadedcomputation. In cases with substantial streaming write memory traffic,for example, cache coherence overhead can significantly reduce theeffective write bandwidth seen by a GPU 410-413. The efficiency ofoperand setup, the efficiency of results access, and the efficiency ofGPU computation all play a role in determining the effectiveness of GPUoffload.

In one implementation, the selection of between GPU bias and hostprocessor bias is driven by a bias tracker data structure. A bias tablemay be used, for example, which may be a page-granular structure (i.e.,controlled at the granularity of a memory page) that includes 1 or 2bits per GPU-attached memory page. The bias table may be implemented ina stolen memory range of one or more GPU-attached memories 420-423, withor without a bias cache in the GPU 410-413 (e.g., to cachefrequently/recently used entries of the bias table). Alternatively, theentire bias table may be maintained within the GPU.

In one implementation, the bias table entry associated with each accessto the GPU-attached memory 420-423 is accessed prior the actual accessto the GPU memory, causing the following operations. First, localrequests from the GPU 410-413 that find their page in GPU bias areforwarded directly to a corresponding GPU memory 420-423. Local requestsfrom the GPU that find their page in host bias are forwarded to theprocessor 405 (e.g., over a high speed link as discussed above). In oneembodiment, requests from the processor 405 that find the requested pagein host processor bias complete the request like a normal memory read.Alternatively, requests directed to a GPU-biased page may be forwardedto the GPU 410-413. The GPU may then transition the page to a hostprocessor bias if it is not currently using the page.

The bias state of a page can be changed either by a software-basedmechanism, a hardware-assisted software-based mechanism, or, for alimited set of cases, a purely hardware-based mechanism.

One mechanism for changing the bias state employs an API call (e.g.,OpenCL), which, in turn, calls the GPU's device driver which, in turn,sends a message (or enqueues a command descriptor) to the GPU directingit to change the bias state and, for some transitions, perform a cacheflushing operation in the host. The cache flushing operation is requiredfor a transition from host processor 405 bias to GPU bias but is notrequired for the opposite transition.

In one embodiment, cache coherency is maintained by temporarilyrendering GPU-biased pages uncacheable by the host processor 405. Inorder to access these pages, the processor 405 may request access fromthe GPU 410 which may or may not grant access right away, depending onthe implementation. Thus, to reduce communication between the processor405 and GPU 410 it is beneficial to ensure that GPU-biased pages arethose which are required by the GPU but not the host processor 405 andvice versa.

Graphics Processing Pipeline

FIG. 5 illustrates a graphics processing pipeline 500, according to anembodiment. In one embodiment, a graphics processor can implement theillustrated graphics processing pipeline 500. The graphics processor canbe included within the parallel processing subsystems as describedherein, such as the parallel processor 200 of FIG. 2A, which, in oneembodiment, is a variant of the parallel processor(s) 112 of FIG. 1 .The various parallel processing systems can implement the graphicsprocessing pipeline 500 via one or more instances of the parallelprocessing unit (e.g., parallel processing unit 202 of FIG. 2A) asdescribed herein. For example, a shader unit (e.g., graphicsmultiprocessor 234 of FIG. 3A) may be configured to perform thefunctions of one or more of a vertex processing unit 504, a tessellationcontrol processing unit 508, a tessellation evaluation processing unit512, a geometry processing unit 516, and a fragment/pixel processingunit 524. The functions of data assembler 502, primitive assemblers 506,514, 518, tessellation unit 510, rasterizer 522, and raster operationsunit 526 may also be performed by other processing engines within aprocessing cluster (e.g., processing cluster 214 of FIG. 2C) and acorresponding partition unit (e.g., partition unit 220A-220N of FIG.2A). The graphics processing pipeline 500 may also be implemented usingdedicated processing units for one or more functions. In one embodiment,one or more portions of the graphics processing pipeline 500 can beperformed by parallel processing logic within a general-purposeprocessor (e.g., CPU). In one embodiment, one or more portions of thegraphics processing pipeline 500 can access on-chip memory (e.g.,parallel processor memory 222 as in FIG. 2A) via a memory interface 528,which may be an instance of the memory interface 218 of FIG. 2A.

In one embodiment, the data assembler 502 is a processing unit thatcollects vertex data for surfaces and primitives. The data assembler 502then outputs the vertex data, including the vertex attributes, to thevertex processing unit 504. The vertex processing unit 504 is aprogrammable execution unit that executes vertex shader programs,lighting and transforming vertex data as specified by the vertex shaderprograms. The vertex processing unit 504 reads data that is stored incache, local or system memory for use in processing the vertex data andmay be programmed to transform the vertex data from an object-basedcoordinate representation to a world space coordinate space or anormalized device coordinate space.

A first instance of a primitive assembler 506 receives vertex attributesfrom the vertex processing unit 504. The primitive assembler 506readings stored vertex attributes as needed and constructs graphicsprimitives for processing by tessellation control processing unit 508.The graphics primitives include triangles, line segments, points,patches, and so forth, as supported by various graphics processingapplication programming interfaces (APIs).

The tessellation control processing unit 508 treats the input verticesas control points for a geometric patch. The control points aretransformed from an input representation from the patch (e.g., thepatch's bases) to a representation that is suitable for use in surfaceevaluation by the tessellation evaluation processing unit 512. Thetessellation control processing unit 508 can also compute tessellationfactors for edges of geometric patches. A tessellation factor applies toa single edge and quantifies a view-dependent level of detail associatedwith the edge. A tessellation unit 510 is configured to receive thetessellation factors for edges of a patch and to tessellate the patchinto multiple geometric primitives such as line, triangle, orquadrilateral primitives, which are transmitted to a tessellationevaluation processing unit 512. The tessellation evaluation processingunit 512 operates on parameterized coordinates of the subdivided patchto generate a surface representation and vertex attributes for eachvertex associated with the geometric primitives.

A second instance of a primitive assembler 514 receives vertexattributes from the tessellation evaluation processing unit 512, readingstored vertex attributes as needed, and constructs graphics primitivesfor processing by the geometry processing unit 516. The geometryprocessing unit 516 is a programmable execution unit that executesgeometry shader programs to transform graphics primitives received fromprimitive assembler 514 as specified by the geometry shader programs. Inone embodiment the geometry processing unit 516 is programmed tosubdivide the graphics primitives into one or more new graphicsprimitives and calculate parameters used to rasterize the new graphicsprimitives.

In some embodiments the geometry processing unit 516 can add or deleteelements in the geometry stream. The geometry processing unit 516outputs the parameters and vertices specifying new graphics primitivesto primitive assembler 518. The primitive assembler 518 receives theparameters and vertices from the geometry processing unit 516 andconstructs graphics primitives for processing by a viewport scale, cull,and clip unit 520. The geometry processing unit 516 reads data that isstored in parallel processor memory or system memory for use inprocessing the geometry data. The viewport scale, cull, and clip unit520 performs clipping, culling, and viewport scaling and outputsprocessed graphics primitives to a rasterizer 522. The rasterizer 522can perform depth culling and other depth-based optimizations. Therasterizer 522 also performs scan conversion on the new graphicsprimitives to generate fragments and output those fragments andassociated coverage data to the fragment/pixel processing unit 524.

The fragment/pixel processing unit 524 is a programmable execution unitthat is configured to execute fragment shader programs or pixel shaderprograms. The fragment/pixel processing unit 524 transforming fragmentsor pixels received from rasterizer 522, as specified by the fragment orpixel shader programs. For example, the fragment/pixel processing unit524 may be programmed to perform operations included but not limited totexture mapping, shading, blending, texture correction and perspectivecorrection to produce shaded fragments or pixels that are output to araster operations unit 526. The fragment/pixel processing unit 524 canread data that is stored in either the parallel processor memory or thesystem memory for use when processing the fragment data. Fragment orpixel shader programs may be configured to shade at sample, pixel, tile,or other granularities depending on the sampling rate configured for theprocessing units.

The raster operations unit 526 is a processing unit that performs rasteroperations including, but not limited to stencil, z test, blending, andthe like, and outputs pixel data as processed graphics data to be storedin graphics memory (e.g., parallel processor memory 222 as in FIG. 2A,to be displayed on the one or more display device(s) 110A-110B or forfurther processing by one of the one or more processor(s) 102 orparallel processor(s) 112. In some embodiments, the raster operationsunit 526 is configured to compress z or color data that is written tomemory and decompress z or color data that is read from memory.

FIG. 6 illustrates one embodiment of a computing device 600 employing ascheduling mechanism that accounts for barrier usage during threadscheduling. Computing device 600 (e.g., smart wearable devices, virtualreality (VR) devices, head-mounted display (HMDs), mobile computers,Internet of Things (IoT) devices, laptop computers, desktop computers,server computers, etc.) may be the same as data processing system 100 ofFIG. 1 and accordingly, for brevity, clarity, and ease of understanding,many of the details stated above with reference to FIGS. 1-5 are notfurther discussed or repeated hereafter. As illustrated, in oneembodiment, computing device 600 is shown as hosting a barrier usagemodule 610.

As illustrated, in one embodiment, barrier usage module 610 may behosted by graphics driver 616. However, in other embodiments, barrierusage module 610 may be hosted by or part of firmware of graphicsprocessing unit (“GPU” or “graphics processor”) 614. In yet otherembodiments, barrier usage module 610 may be hosted by or part offirmware of central processing unit (“CPU” or “application processor”)612. For brevity, clarity, and ease of understanding, throughout therest of this document, barrier usage module 610 may be discussed as partof graphics driver 616; however, embodiments are not limited as such.

In yet another embodiment, barrier usage module 610 may be hosted assoftware or firmware logic by operating system 606. In yet a furtherembodiment, barrier usage module 610 may be partially and simultaneouslyhosted by multiple components of computing device 600, such as one ormore of graphics driver 616, GPU 614, GPU firmware, CPU 612, CPUfirmware, operating system 606, and/or the like. It is contemplated thatbarrier usage module 610 or one or more of its components may beimplemented as hardware, software, and/or firmware.

Throughout the document, term “user” may be interchangeably referred toas “viewer”, “observer”, “person”, “individual”, “end-user”, and/or thelike. It is to be noted that throughout this document, terms like“graphics domain” may be referenced interchangeably with “graphicsprocessing unit”, “graphics processor”, or simply “GPU” and similarly,“CPU domain” or “host domain” may be referenced interchangeably with“computer processing unit”, “application processor”, or simply “CPU”.

Computing device 600 may include any number and type of communicationdevices, such as large computing systems, such as server computers,desktop computers, etc., and may further include set-top boxes (e.g.,Internet-based cable television set-top boxes, etc.), global positioningsystem (GPS)-based devices, etc. Computing device 600 may include mobilecomputing devices serving as communication devices, such as cellularphones including smartphones, personal digital assistants (PDAs), tabletcomputers, laptop computers, e-readers, smart televisions, televisionplatforms, wearable devices (e.g., glasses, watches, bracelets,smartcards, jewelry, clothing items, etc.), media players, etc. Forexample, in one embodiment, computing device 600 may include a mobilecomputing device employing a computer platform hosting an integratedcircuit (“IC”), such as system on a chip (“SoC” or “SOC”), integratingvarious hardware and/or software components of computing device 600 on asingle chip.

As illustrated, in one embodiment, computing device 600 may include anynumber and type of hardware and/or software components, such as (withoutlimitation) GPU 614, graphics driver (also referred to as “GPU driver”,“graphics driver logic”, “driver logic”, user-mode driver (UMD), UMD,user-mode driver framework (UMDF), UMDF, or simply “driver”) 616, CPU612, memory 608, network devices, drivers, or the like, as well asinput/output (I/O) sources 604, such as touchscreens, touch panels,touch pads, virtual or regular keyboards, virtual or regular mice,ports, connectors, etc.

Computing device 600 may include operating system (OS) 606 serving as aninterface between hardware and/or physical resources of the computingdevice 600 and a user. It is contemplated that CPU 612 may include oneor more processors, such as processor(s) 102 of FIG. 1 , while GPU 614may include one or more graphics processors (or multiprocessors).

It is to be noted that terms like “node”, “computing node”, “server”,“server device”, “cloud computer”, “cloud server”, “cloud servercomputer”, “machine”, “host machine”, “device”, “computing device”,“computer”, “computing system”, and the like, may be usedinterchangeably throughout this document. It is to be further noted thatterms like “application”, “software application”, “program”, “softwareprogram”, “package”, “software package”, and the like, may be usedinterchangeably throughout this document. Also, terms like “job”,“input”, “request”, “message”, and the like, may be used interchangeablythroughout this document.

It is contemplated and as further described with reference to FIGS. 1-5, some processes of the graphics pipeline as described above areimplemented in software, while the rest are implemented in hardware. Agraphics pipeline may be implemented in a graphics coprocessor design,where CPU 612 is designed to work with GPU 614 which may be included inor co-located with CPU 612. In one embodiment, GPU 614 may employ anynumber and type of conventional software and hardware logic to performthe conventional functions relating to graphics rendering as well asnovel software and hardware logic to execute any number and type ofinstructions.

As aforementioned, memory 608 may include a random access memory (RAM)comprising application database having object information. A memorycontroller hub, such as memory hub 105 of FIG. 1 , may access data inthe RAM and forward it to GPU 614 for graphics pipeline processing. RAMmay include double data rate RAM (DDR RAM), extended data output RAM(EDO RAM), etc. CPU 612 interacts with a hardware graphics pipeline toshare graphics pipelining functionality.

Processed data is stored in a buffer in the hardware graphics pipeline,and state information is stored in memory 608. The resulting image isthen transferred to I/O sources 604, such as a display component fordisplaying of the image. It is contemplated that the display device maybe of various types, such as Cathode Ray Tube (CRT), Thin FilmTransistor (TFT), Liquid Crystal Display (LCD), Organic Light EmittingDiode (OLED) array, etc., to display information to a user.

Memory 608 may comprise a pre-allocated region of a buffer (e.g., framebuffer); however, it should be understood by one of ordinary skill inthe art that the embodiments are not so limited, and that any memoryaccessible to the lower graphics pipeline may be used. Computing device600 may further include input/output (I/O) control hub (ICH) 107 asreferenced in FIG. 1 , as one or more I/O sources 604, etc.

CPU 612 may include one or more processors to execute instructions inorder to perform whatever software routines the computing systemimplements. The instructions frequently involve some sort of operationperformed upon data. Both data and instructions may be stored in systemmemory 608 and any associated cache. Cache is typically designed to haveshorter latency times than system memory 608; for example, cache mightbe integrated onto the same silicon chip(s) as the processor(s) and/orconstructed with faster static RAM (SRAM) cells whilst the system memory608 might be constructed with slower dynamic RAM (DRAM) cells. Bytending to store more frequently used instructions and data in the cacheas opposed to the system memory 608, the overall performance efficiencyof computing device 600 improves. It is contemplated that in someembodiments, GPU 614 may exist as part of CPU 612 (such as part of aphysical CPU package) in which case, memory 608 may be shared by CPU 612and GPU 614 or kept separated.

System memory 608 may be made available to other components within thecomputing device 600. For example, any data (e.g., input graphics data)received from various interfaces to the computing device 600 (e.g.,keyboard and mouse, printer port, Local Area Network (LAN) port, modemport, etc.) or retrieved from an internal storage element of thecomputing device 600 (e.g., hard disk drive) are often temporarilyqueued into system memory 608 prior to being operated upon by the one ormore processor(s) in the implementation of a software program.Similarly, data that a software program determines should be sent fromthe computing device 600 to an outside entity through one of thecomputing system interfaces, or stored into an internal storage element,is often temporarily queued in system memory 608 prior to its beingtransmitted or stored.

Further, for example, an ICH may be used for ensuring that such data isproperly passed between the system memory 608 and its appropriatecorresponding computing system interface (and internal storage device ifthe computing system is so designed) and may have bi-directionalpoint-to-point links between itself and the observed I/O sources 604 orother I/O devices. Similarly, an MCH may be used for managing thevarious contending requests for system memory 608 accesses amongst CPU612 and GPU 614, interfaces and internal storage elements that mayproximately arise in time with respect to one another.

I/O sources 604 may include one or more I/O devices that are implementedfor transferring data to and/or from computing device 600 (e.g., anetworking adapter); or, for a large scale non-volatile storage withincomputing device 600 (e.g., hard disk drive). User input device,including alphanumeric and other keys, may be used to communicateinformation and command selections to GPU 614. Another type of userinput device is cursor control, such as a mouse, a trackball, atouchscreen, a touchpad, or cursor direction keys to communicatedirection information and command selections to GPU 614 and to controlcursor movement on the display device. Camera and microphone arrays ofcomputing device 600 may be employed to observe gestures, record audioand video and to receive and transmit visual and audio commands.

Computing device 600 may further include network interface(s) to provideaccess to a network, such as a LAN, a wide area network (WAN), ametropolitan area network (MAN), a personal area network (PAN),Bluetooth, a cloud network, a mobile network (e.g., 3rd Generation (3G),4th Generation (4G), etc.), an intranet, the Internet, etc. Networkinterface(s) may include, for example, a wireless network interfacehaving antenna, which may represent one or more antenna(e). Networkinterface(s) may also include, for example, a wired network interface tocommunicate with remote devices via network cable, which may be, forexample, an Ethernet cable, a coaxial cable, a fiber optic cable, aserial cable, or a parallel cable.

Network interface(s) may provide access to a LAN, for example, byconforming to IEEE 802.11b and/or IEEE 802.11g standards, and/or thewireless network interface may provide access to a personal areanetwork, for example, by conforming to Bluetooth standards. Otherwireless network interfaces and/or protocols, including previous andsubsequent versions of the standards, may also be supported. In additionto, or instead of, communication via the wireless LAN standards, networkinterface(s) may provide wireless communication using, for example, TimeDivision, Multiple Access (TDMA) protocols, Global Systems for MobileCommunications (GSM) protocols, Code Division, Multiple Access (CDMA)protocols, and/or any other type of wireless communications protocols.

Network interface(s) may include one or more communication interfaces,such as a modem, a network interface card, or other well-known interfacedevices, such as those used for coupling to the Ethernet, token ring, orother types of physical wired or wireless attachments for purposes ofproviding a communication link to support a LAN or a WAN, for example.In this manner, the computer system may also be coupled to a number ofperipheral devices, clients, control surfaces, consoles, or servers viaa conventional network infrastructure, including an Intranet or theInternet, for example.

It is to be appreciated that a lesser or more equipped system than theexample described above may be preferred for certain implementations.Therefore, the configuration of computing device 600 may vary fromimplementation to implementation depending upon numerous factors, suchas price constraints, performance requirements, technologicalimprovements, or other circumstances. Examples of the electronic deviceor computing device 600 may include (without limitation) a mobiledevice, a personal digital assistant, a mobile computing device, asmartphone, a cellular telephone, a handset, a one-way pager, a two-waypager, a messaging device, a computer, a personal computer (PC), adesktop computer, a laptop computer, a notebook computer, a handheldcomputer, a tablet computer, a server, a server array or server farm, aweb server, a network server, an Internet server, a work station, amini-computer, a main frame computer, a supercomputer, a networkappliance, a web appliance, a distributed computing system,multiprocessor systems, processor-based systems, consumer electronics,programmable consumer electronics, television, digital television, settop box, wireless access point, base station, subscriber station, mobilesubscriber center, radio network controller, router, hub, gateway,bridge, switch, machine, or combinations thereof.

Embodiments may be implemented as any or a combination of: one or moremicrochips or integrated circuits interconnected using a parentboard,hardwired logic, software stored by a memory device and executed by amicroprocessor, firmware, an application specific integrated circuit(ASIC), and/or a field programmable gate array (FPGA). The term “logic”may include, by way of example, software or hardware and/or combinationsof software and hardware.

Embodiments may be provided, for example, as a computer program productwhich may include one or more machine-readable media having storedthereon machine-executable instructions that, when executed by one ormore machines such as a computer, network of computers, or otherelectronic devices, may result in the one or more machines carrying outoperations in accordance with embodiments described herein. Amachine-readable medium may include, but is not limited to, floppydiskettes, optical disks, CD-ROMs (Compact Disc-Read Only Memories), andmagneto-optical disks, ROMs, RAMs, EPROMs (Erasable Programmable ReadOnly Memories), EEPROMs (Electrically Erasable Programmable Read OnlyMemories), magnetic or optical cards, flash memory, or other type ofmedia/machine-readable medium suitable for storing machine-executableinstructions.

Moreover, embodiments may be downloaded as a computer program product,wherein the program may be transferred from a remote computer (e.g., aserver) to a requesting computer (e.g., a client) by way of one or moredata signals embodied in and/or modulated by a carrier wave or otherpropagation medium via a communication link (e.g., a modem and/ornetwork connection).

According to one embodiment, a scheduling mechanism implements barrierusage module 610, as well as compiler 611 and scheduler 613 to accountfor barrier usage in a thread group during thread scheduling acrossmultiprocessors within GPU 614. In such an embodiment, a thread policyis implemented that provides weight values based on the use of barriersin a thread group, in addition to conventional load balancing across themultiprocessors. If, based on the weight values, there is adetermination that thread usage within a thread group is high, scheduler613 attempts to schedule all of the threads in the thread group to thesame multiprocessor to minimize cross-multiprocessor barrier overhead.

FIG. 7 illustrates one embodiment of a flow diagram illustrating aprocess to implement a scheduling mechanism. At processing block 710,compiler 611 receives an application kernel. At processing block 720,compiler 611 analyzes the kernel to determine barrier usage. In such anembodiment, compiler 611 determines the magnitude of barrier messages inthe kernel and assigns a weight value based on the magnitude. In oneembodiment, the weight value ranges from 0-100, where 0 represents nouse of barriers, and 100 represents maximum use of barriers. However, inother embodiments, different weighting schemes may be implemented.

At processing block 730, barrier usage module 610 receives the weightedbarrier usage data from compiler 611 and stores the data in memory 608as kernel thread meta-data. At processing block 740, scheduler 613parses the thread meta-data for the kernel. At processing block 750,scheduler 613 performs thread scheduling based on a scheduling policythat includes both barrier usage and usual multiprocessor loadbalancing.

According to one embodiment, scheduler 613 performs load balancing byattempting to minimize the following cost function for a new thread, T:

-   Cost0=MAX (Num_free_threads(SMi)) i=0 . . . N (all SMs), where    Num_free_threads (SMi) returns the number of free threads in the    multiprocessor SMi after scheduling the new thread T.

According to one embodiment, scheduler 613 includes the following newcost function:

-   Cost1=Barrier_Usage_Weight×(Num_SM_Used−1), where    Barrier_Usage_Weight is the kernel's barrier usage weight (0 to    100), as determined by compiler 611, and Num_SM_used is the number    of different SMs used by this thread-group after scheduling the new    thread T.

The final cost function is a weighted sum of Cost0 and Cost1:

-   Cost=Cost0+k·Cost1, where k is a co-efficient that is programmable    by driver 616.

In one embodiment, scheduler 613 schedules a new thread T to an SM suchthat Cost is minimized. Thus, scheduler 613 gives a high priority tominimizing cross-multiprocessor barrier overhead whenever the kernelheavily uses barriers. For kernels with little use of barriers,scheduler 613 performs the legacy scheduling process based onload-balancing.

Additional Exemplary Graphics Processing System

Details of the embodiments described above can be incorporated withingraphics processing systems and devices described below. The graphicsprocessing system and devices of FIGS. 8-21 illustrate alternativesystems and graphics processing hardware that can implement any and allof the techniques described above.

Additional Exemplary Graphics Processing System Overview

FIG. 8 is a block diagram of a processing system 1600, according to anembodiment. In various embodiments, the system 1600 includes one or moreprocessors 1602 and one or more graphics processors 1608, and may be asingle processor desktop system, a multiprocessor workstation system, ora server system having a large number of processors 1602 or processorcores 1607. In one embodiment, the system 1600 is a processing platformincorporated within a system-on-a-chip (SoC) integrated circuit for usein mobile, handheld, or embedded devices.

An embodiment of system 1600 can include or be incorporated within aserver-based gaming platform, a game console, including a game and mediaconsole, a mobile gaming console, a handheld game console, or an onlinegame console. In some embodiments system 1600 is a mobile phone, smartphone, tablet computing device or mobile Internet device. Dataprocessing system 1600 can also include, couple with, or be integratedwithin a wearable device, such as a smart watch wearable device, smarteyewear device, augmented reality device, or virtual reality device. Insome embodiments, data processing system 1600 is a television or set topbox device having one or more processors 1602 and a graphical interfacegenerated by one or more graphics processors 1608.

In some embodiments, the one or more processors 1602 each include one ormore processor cores 1607 to process instructions which, when executed,perform operations for system and user software. In some embodiments,each of the one or more processor cores 1607 is configured to process aspecific instruction set 1609. In some embodiments, instruction set 1609may facilitate Complex Instruction Set Computing (CISC), ReducedInstruction Set Computing (RISC), or computing via a Very LongInstruction Word (VLIW). Multiple processor cores 1607 may each processa different instruction set 1609, which may include instructions tofacilitate the emulation of other instruction sets. Processor core 1607may also include other processing devices, such a Digital SignalProcessor (DSP).

In some embodiments, the processor 1602 includes cache memory 1604.Depending on the architecture, the processor 1602 can have a singleinternal cache or multiple levels of internal cache. In someembodiments, the cache memory is shared among various components of theprocessor 1602. In some embodiments, the processor 1602 also uses anexternal cache (e.g., a Level-3 (L3) cache or Last Level Cache (LLC))(not shown), which may be shared among processor cores 1607 using knowncache coherency techniques. A register file 1606 is additionallyincluded in processor 1602 which may include different types ofregisters for storing different types of data (e.g., integer registers,floating point registers, status registers, and an instruction pointerregister). Some registers may be general-purpose registers, while otherregisters may be specific to the design of the processor 1602.

In some embodiments, processor 1602 is coupled with a processor bus 1610to transmit communication signals such as address, data, or controlsignals between processor 1602 and other components in system 1600. Inone embodiment the system 1600 uses an exemplary ‘hub’ systemarchitecture, including a memory controller hub 1616 and an Input Output(I/O) controller hub 1630. A memory controller hub 1616 facilitatescommunication between a memory device and other components of system1600, while an I/O Controller Hub (ICH) 1630 provides connections to I/Odevices via a local I/O bus. In one embodiment, the logic of the memorycontroller hub 1616 is integrated within the processor.

Memory device 1620 can be a dynamic random access memory (DRAM) device,a static random access memory (SRAM) device, flash memory device,phase-change memory device, or some other memory device having suitableperformance to serve as process memory. In one embodiment the memorydevice 1620 can operate as system memory for the system 1600, to storedata 1622 and instructions 1621 for use when the one or more processors1602 executes an application or process. Memory controller hub 1616 alsocouples with an optional external graphics processor 1612, which maycommunicate with the one or more graphics processors 1608 in processors1602 to perform graphics and media operations.

In some embodiments, ICH 1630 enables peripherals to connect to memorydevice 1620 and processor 1602 via a high-speed I/O bus. The I/Operipherals include, but are not limited to, an audio controller 1646, afirmware interface 1628, a wireless transceiver 1626 (e.g., Wi-Fi,Bluetooth), a data storage device 1624 (e.g., hard disk drive, flashmemory, etc.), and a legacy I/O controller 1640 for coupling legacy(e.g., Personal System 2 (PS/2)) devices to the system. One or moreUniversal Serial Bus (USB) controllers 1642 connect input devices, suchas keyboard and mouse 1644 combinations. A network controller 1634 mayalso couple with ICH 1630. In some embodiments, a high-performancenetwork controller (not shown) couples with processor bus 1610. It willbe appreciated that the system 1600 shown is exemplary and not limiting,as other types of data processing systems that are differentlyconfigured may also be used. For example, the I/O controller hub 1630may be integrated within the one or more processor 1602, or the memorycontroller hub 1616 and I/O controller hub 1630 may be integrated into adiscreet external graphics processor, such as the external graphicsprocessor 1612.

FIG. 9 is a block diagram of an embodiment of a processor 1700 havingone or more processor cores 1702A-1702N, an integrated memory controller1714, and an integrated graphics processor 1708. Those elements of FIG.9 having the same reference numbers (or names) as the elements of anyother figure herein can operate or function in any manner similar tothat described elsewhere herein, but are not limited to such. Processor1700 can include additional cores up to and including additional core1702N represented by the dashed lined boxes. Each of processor cores1702A-1702N includes one or more internal cache units 1704A-1704N. Insome embodiments each processor core also has access to one or moreshared cached units 1706.

The internal cache units 1704A-1704N and shared cache units 1706represent a cache memory hierarchy within the processor 1700. The cachememory hierarchy may include at least one level of instruction and datacache within each processor core and one or more levels of sharedmid-level cache, such as a Level 2 (L2), Level 3 (L3), Level 4 (L4), orother levels of cache, where the highest level of cache before externalmemory is classified as the LLC. In some embodiments, cache coherencylogic maintains coherency between the various cache units 1706 and1704A-1704N.

In some embodiments, processor 1700 may also include a set of one ormore bus controller units 1716 and a system agent core 1710. The one ormore bus controller units 1716 manage a set of peripheral buses, such asone or more Peripheral Component Interconnect buses (e.g., PCI, PCIExpress). System agent core 1710 provides management functionality forthe various processor components. In some embodiments, system agent core1710 includes one or more integrated memory controllers 1714 to manageaccess to various external memory devices (not shown).

In some embodiments, one or more of the processor cores 1702A-1702Ninclude support for simultaneous multi-threading. In such embodiment,the system agent core 1710 includes components for coordinating andoperating cores 1702A-1702N during multi-threaded processing. Systemagent core 1710 may additionally include a power control unit (PCU),which includes logic and components to regulate the power state ofprocessor cores 1702A-1702N and graphics processor 1708.

In some embodiments, processor 1700 additionally includes graphicsprocessor 1708 to execute graphics processing operations. In someembodiments, the graphics processor 1708 couples with the set of sharedcache units 1706, and the system agent core 1710, including the one ormore integrated memory controllers 1714. In some embodiments, a displaycontroller 1711 is coupled with the graphics processor 1708 to drivegraphics processor output to one or more coupled displays. In someembodiments, display controller 1711 may be a separate module coupledwith the graphics processor via at least one interconnect, or may beintegrated within the graphics processor 1708 or system agent core 1710.

In some embodiments, a ring-based interconnect 1712 is used to couplethe internal components of the processor 1700. However, an alternativeinterconnect unit may be used, such as a point-to-point interconnect, aswitched interconnect, or other techniques, including techniques wellknown in the art. In some embodiments, graphics processor 1708 coupleswith the ring-based interconnect 1712 via an I/O link 1713.

The exemplary I/O link 1713 represents at least one of multiplevarieties of I/O interconnects, including an on-package I/O interconnectwhich facilitates communication between various processor components anda high-performance embedded memory module 1718, such as an eDRAM module.In some embodiments, each of the processor cores 1702A-1702N andgraphics processor 1708 use embedded memory modules 1718 as a sharedLast Level Cache.

In some embodiments, processor cores 1702A-1702N are homogenous coresexecuting the same instruction set architecture. In another embodiment,processor cores 1702A-1702N are heterogeneous in terms of instructionset architecture (ISA), where one or more of processor cores 1702A-1702Nexecute a first instruction set, while at least one of the other coresexecutes a subset of the first instruction set or a differentinstruction set. In one embodiment processor cores 1702A-1702N areheterogeneous in terms of microarchitecture, where one or more coreshaving a relatively higher power consumption couple with one or morepower cores having a lower power consumption. Additionally, processor1700 can be implemented on one or more chips or as an SoC integratedcircuit having the illustrated components, in addition to othercomponents.

FIG. 10 is a block diagram of a graphics processor 1800, which may be adiscrete graphics processing unit, or may be a graphics processorintegrated with a plurality of processing cores. In some embodiments,the graphics processor communicates via a memory mapped I/O interface toregisters on the graphics processor and with commands placed into theprocessor memory. In some embodiments, graphics processor 1800 includesa memory interface 1814 to access memory. Memory interface 1814 can bean interface to local memory, one or more internal caches, one or moreshared external caches, and/or to system memory.

In some embodiments, graphics processor 1800 also includes a displaycontroller 1802 to drive display output data to a display device 1820.Display controller 1802 includes hardware for one or more overlay planesfor the display and composition of multiple layers of video or userinterface elements. In some embodiments, graphics processor 1800includes a video codec engine 1806 to encode, decode, or transcode mediato, from, or between one or more media encoding formats, including, butnot limited to Moving Picture Experts Group (MPEG) formats such asMPEG-2, Advanced Video Coding (AVC) formats such as H.264/MPEG-4 AVC, aswell as the Society of Motion Picture & Television Engineers (SMPTE)421M/VC-1, and Joint Photographic Experts Group (JPEG) formats such asJPEG, and Motion JPEG (MJPEG) formats.

In some embodiments, graphics processor 1800 includes a block imagetransfer (BLIT) engine 1804 to perform two-dimensional (2D) rasterizeroperations including, for example, bit-boundary block transfers.However, in one embodiment, 2D graphics operations are performed usingone or more components of graphics processing engine (GPE) 1810. In someembodiments, GPE 1810 is a compute engine for performing graphicsoperations, including three-dimensional (3D) graphics operations andmedia operations.

In some embodiments, GPE 1810 includes a 3D pipeline 1812 for performing3D operations, such as rendering three-dimensional images and scenesusing processing functions that act upon 3D primitive shapes (e.g.,rectangle, triangle, etc.). The 3D pipeline 1812 includes programmableand fixed function elements that perform various tasks within theelement and/or spawn execution threads to a 3D/Media subsystem 1815.While 3D pipeline 1812 can be used to perform media operations, anembodiment of GPE 1810 also includes a media pipeline 1816 that isspecifically used to perform media operations, such as videopost-processing and image enhancement.

In some embodiments, media pipeline 1816 includes fixed function orprogrammable logic units to perform one or more specialized mediaoperations, such as video decode acceleration, video de-interlacing, andvideo encode acceleration in place of, or on behalf of video codecengine 1806. In some embodiments, media pipeline 1816 additionallyincludes a thread spawning unit to spawn threads for execution on3D/Media subsystem 1815. The spawned threads perform computations forthe media operations on one or more graphics execution units included in3D/Media subsystem 1815.

In some embodiments, 3D/Media subsystem 1815 includes logic forexecuting threads spawned by 3D pipeline 1812 and media pipeline 1816.In one embodiment, the pipelines send thread execution requests to3D/Media subsystem 1815, which includes thread dispatch logic forarbitrating and dispatching the various requests to available threadexecution resources. The execution resources include an array ofgraphics execution units to process the 3D and media threads. In someembodiments, 3D/Media subsystem 1815 includes one or more internalcaches for thread instructions and data. In some embodiments, thesubsystem also includes shared memory, including registers andaddressable memory, to share data between threads and to store outputdata.

Graphics Processing Engine

FIG. 11 is a block diagram of a graphics processing engine 1910 of agraphics processor in accordance with some embodiments. In oneembodiment, the graphics processing engine (GPE) 1910 is a version ofthe GPE 1810 shown in FIG. 10 . Elements of FIG. 11 having the samereference numbers (or names) as the elements of any other figure hereincan operate or function in any manner similar to that describedelsewhere herein, but are not limited to such. For example, the 3Dpipeline 1812 and media pipeline 1816 of FIG. 10 are illustrated. Themedia pipeline 1816 is optional in some embodiments of the GPE 1910 andmay not be explicitly included within the GPE 1910. For example and inat least one embodiment, a separate media and/or image processor iscoupled to the GPE 1910.

In some embodiments, GPE 1910 couples with or includes a commandstreamer 1903, which provides a command stream to the 3D pipeline 1812and/or media pipelines 1816. In some embodiments, command streamer 1903is coupled with memory, which can be system memory, or one or more ofinternal cache memory and shared cache memory. In some embodiments,command streamer 1903 receives commands from the memory and sends thecommands to 3D pipeline 1812 and/or media pipeline 1816. The commandsare directives fetched from a ring buffer, which stores commands for the3D pipeline 1812 and media pipeline 1816. In one embodiment, the ringbuffer can additionally include batch command buffers storing batches ofmultiple commands. The commands for the 3D pipeline 1812 can alsoinclude references to data stored in memory, such as but not limited tovertex and geometry data for the 3D pipeline 1812 and/or image data andmemory objects for the media pipeline 1816. The 3D pipeline 1812 andmedia pipeline 1816 process the commands and data by performingoperations via logic within the respective pipelines or by dispatchingone or more execution threads to a graphics core array 1914.

In various embodiments the 3D pipeline 1812 can execute one or moreshader programs, such as vertex shaders, geometry shaders, pixelshaders, fragment shaders, compute shaders, or other shader programs, byprocessing the instructions and dispatching execution threads to thegraphics core array 1914. The graphics core array 1914 provides aunified block of execution resources. Multi-purpose execution logic(e.g., execution units) within the graphics core array 1914 includessupport for various 3D API shader languages and can execute multiplesimultaneous execution threads associated with multiple shaders.

In some embodiments the graphics core array 1914 also includes executionlogic to perform media functions, such as video and/or image processing.In one embodiment, the execution units additionally includegeneral-purpose logic that is programmable to perform parallel generalpurpose computational operations, in addition to graphics processingoperations. The general-purpose logic can perform processing operationsin parallel or in conjunction with general purpose logic within theprocessor core(s) 1607 of FIG. 8 or core 1702A-1702N as in FIG. 9 .

Output data generated by threads executing on the graphics core array1914 can output data to memory in a unified return buffer (URB) 1918.The URB 1918 can store data for multiple threads. In some embodimentsthe URB 1918 may be used to send data between different threadsexecuting on the graphics core array 1914. In some embodiments the URB1918 may additionally be used for synchronization between threads on thegraphics core array and fixed function logic within the shared functionlogic 1920.

In some embodiments, graphics core array 1914 is scalable, such that thearray includes a variable number of graphics cores, each having avariable number of execution units based on the target power andperformance level of GPE 1910. In one embodiment the execution resourcesare dynamically scalable, such that execution resources may be enabledor disabled as needed.

The graphics core array 1914 couples with shared function logic 1920that includes multiple resources that are shared between the graphicscores in the graphics core array. The shared functions within the sharedfunction logic 1920 are hardware logic units that provide specializedsupplemental functionality to the graphics core array 1914. In variousembodiments, shared function logic 1920 includes but is not limited tosampler 1921, math 1922, and inter-thread communication (ITC) 1923logic. Additionally, some embodiments implement one or more cache(s)1925 within the shared function logic 1920. A shared function isimplemented where the demand for a given specialized function isinsufficient for inclusion within the graphics core array 1914. Instead,a single instantiation of that specialized function is implemented as astand-alone entity in the shared function logic 1920 and shared amongthe execution resources within the graphics core array 1914. The preciseset of functions that are shared between the graphics core array 1914and included within the graphics core array 1914 varies betweenembodiments.

FIG. 12 is a block diagram of another embodiment of a graphics processor2000. Elements of FIG. 12 having the same reference numbers (or names)as the elements of any other figure herein can operate or function inany manner similar to that described elsewhere herein, but are notlimited to such.

In some embodiments, graphics processor 2000 includes a ringinterconnect 2002, a pipeline front-end 2004, a media engine 2037, andgraphics cores 2080A-2080N. In some embodiments, ring interconnect 2002couples the graphics processor to other processing units, includingother graphics processors or one or more general-purpose processorcores. In some embodiments, the graphics processor is one of manyprocessors integrated within a multi-core processing system.

In some embodiments, graphics processor 2000 receives batches ofcommands via ring interconnect 2002. The incoming commands areinterpreted by a command streamer 2003 in the pipeline front-end 2004.In some embodiments, graphics processor 2000 includes scalable executionlogic to perform 3D geometry processing and media processing via thegraphics core(s) 2080A-2080N. For 3D geometry processing commands,command streamer 2003 supplies commands to geometry pipeline 2036. Forat least some media processing commands, command streamer 2003 suppliesthe commands to a video front end 2034, which couples with a mediaengine 2037. In some embodiments, media engine 2037 includes a VideoQuality Engine (VQE) 2030 for video and image post-processing and amulti-format encode/decode (MFX) 2033 engine to providehardware-accelerated media data encode and decode. In some embodiments,geometry pipeline 2036 and media engine 2037 each generate executionthreads for the thread execution resources provided by at least onegraphics core 2080A.

In some embodiments, graphics processor 2000 includes scalable threadexecution resources featuring modular cores 2080A-2080N (sometimesreferred to as core slices), each having multiple sub-cores 2050A-550N,2060A-2060N (sometimes referred to as core sub-slices). In someembodiments, graphics processor 2000 can have any number of graphicscores 2080A through 2080N. In some embodiments, graphics processor 2000includes a graphics core 2080A having at least a first sub-core 2050Aand a second sub-core 2060A. In other embodiments, the graphicsprocessor is a low power processor with a single sub-core (e.g., 2050A).In some embodiments, graphics processor 2000 includes multiple graphicscores 2080A-2080N, each including a set of first sub-cores 2050A-2050Nand a set of second sub-cores 2060A-2060N. Each sub-core in the set offirst sub-cores 2050A-2050N includes at least a first set of executionunits 2052A-2052N and media/texture samplers 2054A-2054N. Each sub-corein the set of second sub-cores 2060A-2060N includes at least a secondset of execution units 2062A-2062N and samplers 2064A-2064N. In someembodiments, each sub-core 2050A-2050N, 2060A-2060N shares a set ofshared resources 2070A-2070N. In some embodiments, the shared resourcesinclude shared cache memory and pixel operation logic. Other sharedresources may also be included in the various embodiments of thegraphics processor.

Execution Units

FIG. 13 illustrates thread execution logic 2100 including an array ofprocessing elements employed in some embodiments of a GPE. Elements ofFIG. 13 having the same reference numbers (or names) as the elements ofany other figure herein can operate or function in any manner similar tothat described elsewhere herein, but are not limited to such.

In some embodiments, thread execution logic 2100 includes a shaderprocessor 2102, a thread dispatcher 2104, instruction cache 2106, ascalable execution unit array including a plurality of execution units2108A-2108N, a sampler 2110, a data cache 2112, and a data port 2114. Inone embodiment the scalable execution unit array can dynamically scaleby enabling or disabling one or more execution units (e.g., any ofexecution unit 2108A, 2108B, 2108C, 2108D, through 2108N-1 and 2108N)based on the computational requirements of a workload. In one embodimentthe included components are interconnected via an interconnect fabricthat links to each of the components. In some embodiments, threadexecution logic 2100 includes one or more connections to memory, such assystem memory or cache memory, through one or more of instruction cache2106, data port 2114, sampler 2110, and execution units 2108A-2108N. Insome embodiments, each execution unit (e.g., 2108A) is a stand-aloneprogrammable general purpose computational unit that is capable ofexecuting multiple simultaneous hardware threads while processingmultiple data elements in parallel for each thread. In variousembodiments, the array of execution units 2108A-2108N is scalable toinclude any number individual execution units.

In some embodiments, the execution units 2108A-2108N are primarily usedto execute shader programs. A shader processor 2102 can process thevarious shader programs and dispatch execution threads associated withthe shader programs via a thread dispatcher 2104. In one embodiment thethread dispatcher includes logic to arbitrate thread initiation requestsfrom the graphics and media pipelines and instantiate the requestedthreads on one or more execution unit in the execution units2108A-2108N. For example, the geometry pipeline (e.g., 2036 of FIG. 12 )can dispatch vertex, tessellation, or geometry shaders to the threadexecution logic 2100 (FIG. 13 ) for processing. In some embodiments,thread dispatcher 2104 can also process runtime thread spawning requestsfrom the executing shader programs.

In some embodiments, the execution units 2108A-2108N support aninstruction set that includes native support for many standard 3Dgraphics shader instructions, such that shader programs from graphicslibraries (e.g., Direct 3D and OpenGL) are executed with a minimaltranslation. The execution units support vertex and geometry processing(e.g., vertex programs, geometry programs, vertex shaders), pixelprocessing (e.g., pixel shaders, fragment shaders) and general-purposeprocessing (e.g., compute and media shaders). Each of the executionunits 2108A-2108N is capable of multi-issue single instruction multipledata (SIMD) execution and multi-threaded operation enables an efficientexecution environment in the face of higher latency memory accesses.Each hardware thread within each execution unit has a dedicatedhigh-bandwidth register file and associated independent thread-state.Execution is multi-issue per clock to pipelines capable of integer,single and double precision floating point operations, SIMD branchcapability, logical operations, transcendental operations, and othermiscellaneous operations. While waiting for data from memory or one ofthe shared functions, dependency logic within the execution units2108A-2108N causes a waiting thread to sleep until the requested datahas been returned. While the waiting thread is sleeping, hardwareresources may be devoted to processing other threads. For example,during a delay associated with a vertex shader operation, an executionunit can perform operations for a pixel shader, fragment shader, oranother type of shader program, including a different vertex shader.

Each execution unit in execution units 2108A-2108N operates on arrays ofdata elements. The number of data elements is the “execution size,” orthe number of channels for the instruction. An execution channel is alogical unit of execution for data element access, masking, and flowcontrol within instructions. The number of channels may be independentof the number of physical Arithmetic Logic Units (ALUs) or FloatingPoint Units (FPUs) for a particular graphics processor. In someembodiments, execution units 2108A-2108N support integer andfloating-point data types.

The execution unit instruction set includes SIMD instructions. Thevarious data elements can be stored as a packed data type in a registerand the execution unit will process the various elements based on thedata size of the elements. For example, when operating on a 256-bit widevector, the 256 bits of the vector are stored in a register and theexecution unit operates on the vector as four separate 64-bit packeddata elements (Quad-Word (QW) size data elements), eight separate 32-bitpacked data elements (Double Word (DW) size data elements), sixteenseparate 16-bit packed data elements (Word (W) size data elements), orthirty-two separate 8-bit data elements (byte (B) size data elements).However, different vector widths and register sizes are possible.

One or more internal instruction caches (e.g., 2106) are included in thethread execution logic 2100 to cache thread instructions for theexecution units. In some embodiments, one or more data caches (e.g.,2112) are included to cache thread data during thread execution. In someembodiments, a sampler 2110 is included to provide texture sampling for3D operations and media sampling for media operations. In someembodiments, sampler 2110 includes specialized texture or media samplingfunctionality to process texture or media data during the samplingprocess before providing the sampled data to an execution unit.

During execution, the graphics and media pipelines send threadinitiation requests to thread execution logic 2100 via thread spawningand dispatch logic. Once a group of geometric objects has been processedand rasterized into pixel data, pixel processor logic (e.g., pixelshader logic, fragment shader logic, etc.) within the shader processor2102 is invoked to further compute output information and cause resultsto be written to output surfaces (e.g., color buffers, depth buffers,stencil buffers, etc.). In some embodiments, a pixel shader or fragmentshader calculates the values of the various vertex attributes that areto be interpolated across the rasterized object. In some embodiments,pixel processor logic within the shader processor 2102 then executes anapplication programming interface (API)-supplied pixel or fragmentshader program. To execute the shader program, the shader processor 2102dispatches threads to an execution unit (e.g., 2108A) via threaddispatcher 2104. In some embodiments, shader processor 2102 uses texturesampling logic in the sampler 2110 to access texture data in texturemaps stored in memory. Arithmetic operations on the texture data and theinput geometry data compute pixel color data for each geometricfragment, or discards one or more pixels from further processing.

In some embodiments, the data port 2114 provides a memory accessmechanism for the thread execution logic 2100 output processed data tomemory for processing on a graphics processor output pipeline. In someembodiments, the data port 2114 includes or couples to one or more cachememories (e.g., data cache 2112) to cache data for memory access via thedata port.

FIG. 14 is a block diagram illustrating graphics processor instructionformats 2200, according to some embodiments. In one or more embodiment,the graphics processor execution units support an instruction set havinginstructions in multiple formats. The solid lined boxes illustrate thecomponents that are generally included in an execution unit instruction,while the dashed lines include components that are optional or that areonly included in a sub-set of the instructions. In some embodiments,instruction formats 2200 described and illustrated aremacro-instructions, in that they are instructions supplied to theexecution unit, as opposed to micro-operations resulting frominstruction decode once the instruction is processed.

In some embodiments, the graphics processor execution units nativelysupport instructions in a 128-bit instruction format 2210. A 64-bitcompacted instruction format 2230 is available for some instructionsbased on the selected instruction, instruction options, and number ofoperands. The native 128-bit instruction format 2210 provides access toall instruction options, while some options and operations arerestricted in the 64-bit format 2230. The native instructions availablein the 64-bit format 2230 vary by embodiment. In some embodiments, theinstruction is compacted in part using a set of index values in an indexfield 2213. The execution unit hardware references a set of compactiontables based on the index values and uses the compaction table outputsto reconstruct a native instruction in the 128-bit instruction format2210.

For each format, instruction opcode 2212 defines the operation that theexecution unit is to perform. The execution units execute eachinstruction in parallel across the multiple data elements of eachoperand. For example, in response to an add instruction the executionunit performs a simultaneous add operation across each color channelrepresenting a texture element or picture element. By default, theexecution unit performs each instruction across all data channels of theoperands. In some embodiments, instruction control field 2214 enablescontrol over certain execution options, such as channels selection(e.g., predication) and data channel order (e.g., swizzle). Forinstructions in the 128-bit instruction format 2210 an exec-size field2216 limits the number of data channels that will be executed inparallel. In some embodiments, exec-size field 2216 is not available foruse in the 64-bit compact instruction format 2230.

Some execution unit instructions have up to three operands including twosource operands, src0 2220, src1 2222, and one destination 2218. In someembodiments, the execution units support dual destination instructions,where one of the destinations is implied. Data manipulation instructionscan have a third source operand (e.g., SRC2 2224), where the instructionopcode 2212 determines the number of source operands. An instruction'slast source operand can be an immediate (e.g., hard-coded) value passedwith the instruction.

In some embodiments, the 128-bit instruction format 2210 includes anaccess/address mode field 2226 specifying, for example, whether directregister addressing mode or indirect register addressing mode is used.When direct register addressing mode is used, the register address ofone or more operands is directly provided by bits in the instruction.

In some embodiments, the 128-bit instruction format 2210 includes anaccess/address mode field 2226, which specifies an address mode and/oran access mode for the instruction. In one embodiment the access mode isused to define a data access alignment for the instruction. Someembodiments support access modes including a 16-byte aligned access modeand a 1-byte aligned access mode, where the byte alignment of the accessmode determines the access alignment of the instruction operands. Forexample, when in a first mode, the instruction may use byte-alignedaddressing for source and destination operands and when in a secondmode, the instruction may use 16-byte-aligned addressing for all sourceand destination operands.

In one embodiment, the address mode portion of the access/address modefield 2226 determines whether the instruction is to use direct orindirect addressing. When direct register addressing mode is used bitsin the instruction directly provide the register address of one or moreoperands. When indirect register addressing mode is used, the registeraddress of one or more operands may be computed based on an addressregister value and an address immediate field in the instruction.

In some embodiments instructions are grouped based on opcode 2212bit-fields to simplify Opcode decode 2240. For an 8-bit opcode, bits 4,5, and 6 allow the execution unit to determine the type of opcode. Theprecise opcode grouping shown is merely an example. In some embodiments,a move and logic opcode group 2242 includes data movement and logicinstructions (e.g., move (mov), compare (cmp)). In some embodiments,move and logic group 2242 shares the five most significant bits (MSB),where move (mov) instructions are in the form of 0000xxxxb and logicinstructions are in the form of 0001xxxxb. A flow control instructiongroup 2244 (e.g., call, jump (jmp)) includes instructions in the form of0010xxxxb (e.g., 0x20). A miscellaneous instruction group 2246 includesa mix of instructions, including synchronization instructions (e.g.,wait, send) in the form of 0011xxxxb (e.g., 0x30). A parallel mathinstruction group 2248 includes component-wise arithmetic instructions(e.g., add, multiply (mul)) in the form of 0100xxxxb (e.g., 0x40). Theparallel math group 2248 performs the arithmetic operations in parallelacross data channels. The vector math group 2250 includes arithmeticinstructions (e.g., dp4) in the form of 0101xxxxb (e.g., 0x50). Thevector math group performs arithmetic such as dot product calculationson vector operands.

Graphics Pipeline

FIG. 15 is a block diagram of another embodiment of a graphics processor2300. Elements of FIG. 15 having the same reference numbers (or names)as the elements of any other figure herein can operate or function inany manner similar to that described elsewhere herein, but are notlimited to such.

In some embodiments, graphics processor 2300 includes a graphicspipeline 2320, a media pipeline 2330, a display engine 2340, threadexecution logic 2350, and a render output pipeline 2370. In someembodiments, graphics processor 2300 is a graphics processor within amulti-core processing system that includes one or more general purposeprocessing cores. The graphics processor is controlled by registerwrites to one or more control registers (not shown) or via commandsissued to graphics processor 2300 via a ring interconnect 2302. In someembodiments, ring interconnect 2302 couples graphics processor 2300 toother processing components, such as other graphics processors orgeneral-purpose processors. Commands from ring interconnect 2302 areinterpreted by a command streamer 2303, which supplies instructions toindividual components of graphics pipeline 2320 or media pipeline 2330.

In some embodiments, command streamer 2303 directs the operation of avertex fetcher 2305 that reads vertex data from memory and executesvertex-processing commands provided by command streamer 2303. In someembodiments, vertex fetcher 2305 provides vertex data to a vertex shader2307, which performs coordinate space transformation and lightingoperations to each vertex. In some embodiments, vertex fetcher 2305 andvertex shader 2307 execute vertex-processing instructions by dispatchingexecution threads to execution units 2352A-2352B via a thread dispatcher2331.

In some embodiments, execution units 2352A-2352B are an array of vectorprocessors having an instruction set for performing graphics and mediaoperations. In some embodiments, execution units 2352A-2352B have anattached L1 cache 2351 that is specific for each array or shared betweenthe arrays. The cache can be configured as a data cache, an instructioncache, or a single cache that is partitioned to contain data andinstructions in different partitions.

In some embodiments, graphics pipeline 2320 includes tessellationcomponents to perform hardware-accelerated tessellation of 3D objects.In some embodiments, a programmable hull shader 2311 configures thetessellation operations. A programmable domain shader 2317 providesback-end evaluation of tessellation output. A tessellator 2313 operatesat the direction of hull shader 2311 and contains special purpose logicto generate a set of detailed geometric objects based on a coarsegeometric model that is provided as input to graphics pipeline 2320. Insome embodiments, if tessellation is not used, tessellation components(e.g., hull shader 2311, tessellator 2313, and domain shader 2317) canbe bypassed.

In some embodiments, complete geometric objects can be processed by ageometry shader 2319 via one or more threads dispatched to executionunits 2352A-2352B, or can proceed directly to the clipper 2329. In someembodiments, the geometry shader operates on entire geometric objects,rather than vertices or patches of vertices as in previous stages of thegraphics pipeline. If the tessellation is disabled the geometry shader2319 receives input from the vertex shader 2307. In some embodiments,geometry shader 2319 is programmable by a geometry shader program toperform geometry tessellation if the tessellation units are disabled.

Before rasterization, a clipper 2329 processes vertex data. The clipper2329 may be a fixed function clipper or a programmable clipper havingclipping and geometry shader functions. In some embodiments, arasterizer and depth test component 2373 in the render output pipeline2370 dispatches pixel shaders to convert the geometric objects intotheir per pixel representations. In some embodiments, pixel shader logicis included in thread execution logic 2350. In some embodiments, anapplication can bypass the rasterizer and depth test component 2373 andaccess un-rasterized vertex data via a stream out unit 2323.

The graphics processor 2300 has an interconnect bus, interconnectfabric, or some other interconnect mechanism that allows data andmessage passing amongst the major components of the processor. In someembodiments, execution units 2352A-2352B and associated cache(s) 2351,texture and media sampler 2354, and texture/sampler cache 2358interconnect via a data port 2356 to perform memory access andcommunicate with render output pipeline components of the processor. Insome embodiments, sampler 2354, caches 2351, 2358 and execution units2352A-2352B each have separate memory access paths.

In some embodiments, render output pipeline 2370 contains a rasterizerand depth test component 2373 that converts vertex-based objects into anassociated pixel-based representation. In some embodiments, therasterizer logic includes a windower/masker unit to perform fixedfunction triangle and line rasterization. An associated render cache2378 and depth cache 2379 are also available in some embodiments. Apixel operations component 2377 performs pixel-based operations on thedata, though in some instances, pixel operations associated with 2Doperations (e.g., bit block image transfers with blending) are performedby the 2D engine 2341 or substituted at display time by the displaycontroller 2343 using overlay display planes. In some embodiments, ashared L3 cache 2375 is available to all graphics components, allowingthe sharing of data without the use of main system memory.

In some embodiments, graphics processor media pipeline 2330 includes amedia engine 2337 and a video front end 2334. In some embodiments, videofront end 2334 receives pipeline commands from the command streamer2303. In some embodiments, media pipeline 2330 includes a separatecommand streamer. In some embodiments, video front end 2334 processesmedia commands before sending the command to the media engine 2337. Insome embodiments, media engine 2337 includes thread spawningfunctionality to spawn threads for dispatch to thread execution logic2350 via thread dispatcher 2331.

In some embodiments, graphics processor 2300 includes a display engine2340. In some embodiments, display engine 2340 is external to processor2300 and couples with the graphics processor via the ring interconnect2302, or some other interconnect bus or fabric. In some embodiments,display engine 2340 includes a 2D engine 2341 and a display controller2343. In some embodiments, display engine 2340 contains special purposelogic capable of operating independently of the 3D pipeline. In someembodiments, display controller 2343 couples with a display device (notshown), which may be a system integrated display device, as in a laptopcomputer, or an external display device attached via a display deviceconnector.

In some embodiments, graphics pipeline 2320 and media pipeline 2330 areconfigurable to perform operations based on multiple graphics and mediaprogramming interfaces and are not specific to any one applicationprogramming interface (API). In some embodiments, driver software forthe graphics processor translates API calls that are specific to aparticular graphics or media library into commands that can be processedby the graphics processor. In some embodiments, support is provided forthe Open Graphics Library (OpenGL), Open Computing Language (OpenCL),and/or Vulkan graphics and compute API, all from the Khronos Group. Insome embodiments, support may also be provided for the Direct3D libraryfrom the Microsoft Corporation. In some embodiments, a combination ofthese libraries may be supported. Support may also be provided for theOpen Source Computer Vision Library (OpenCV). A future API with acompatible 3D pipeline would also be supported if a mapping can be madefrom the pipeline of the future API to the pipeline of the graphicsprocessor.

Graphics Pipeline Programming

FIG. 16A is a block diagram illustrating a graphics processor commandformat 2400 according to some embodiments. FIG. 16B is a block diagramillustrating a graphics processor command sequence 2410 according to anembodiment. The solid lined boxes in FIG. 16A illustrate the componentsthat are generally included in a graphics command while the dashed linesinclude components that are optional or that are only included in asub-set of the graphics commands. The exemplary graphics processorcommand format 2400 of FIG. 16A includes data fields to identify atarget client 2402 of the command, a command operation code (opcode)2404, and the relevant data 2406 for the command. A sub-opcode 2405 anda command size 2408 are also included in some commands.

In some embodiments, client 2402 specifies the client unit of thegraphics device that processes the command data. In some embodiments, agraphics processor command parser examines the client field of eachcommand to condition the further processing of the command and route thecommand data to the appropriate client unit. In some embodiments, thegraphics processor client units include a memory interface unit, arender unit, a 2D unit, a 3D unit, and a media unit. Each client unithas a corresponding processing pipeline that processes the commands.Once the command is received by the client unit, the client unit readsthe opcode 2404 and, if present, sub-opcode 2405 to determine theoperation to perform. The client unit performs the command usinginformation in data field 2406. For some commands an explicit commandsize 2408 is expected to specify the size of the command. In someembodiments, the command parser automatically determines the size of atleast some of the commands based on the command opcode. In someembodiments commands are aligned via multiples of a double word.

The flow diagram in FIG. 16B shows an exemplary graphics processorcommand sequence 2410. In some embodiments, software or firmware of adata processing system that features an embodiment of a graphicsprocessor uses a version of the command sequence shown to set up,execute, and terminate a set of graphics operations. A sample commandsequence is shown and described for purposes of example only asembodiments are not limited to these specific commands or to thiscommand sequence. Moreover, the commands may be issued as batch ofcommands in a command sequence, such that the graphics processor willprocess the sequence of commands in at least partially concurrence.

In some embodiments, the graphics processor command sequence 2410 maybegin with a pipeline flush command 2412 to cause any active graphicspipeline to complete the currently pending commands for the pipeline. Insome embodiments, the 3D pipeline 2422 and the media pipeline 2424 donot operate concurrently. The pipeline flush is performed to cause theactive graphics pipeline to complete any pending commands. In responseto a pipeline flush, the command parser for the graphics processor willpause command processing until the active drawing engines completepending operations and the relevant read caches are invalidated.Optionally, any data in the render cache that is marked ‘dirty’ can beflushed to memory. In some embodiments, pipeline flush command 2412 canbe used for pipeline synchronization or before placing the graphicsprocessor into a low power state.

In some embodiments, a pipeline select command 2413 is used when acommand sequence requires the graphics processor to explicitly switchbetween pipelines. In some embodiments, a pipeline select command 2413is required only once within an execution context before issuingpipeline commands unless the context is to issue commands for bothpipelines. In some embodiments, a pipeline flush command 2412 isrequired immediately before a pipeline switch via the pipeline selectcommand 2413.

In some embodiments, a pipeline control command 2414 configures agraphics pipeline for operation and is used to program the 3D pipeline2422 and the media pipeline 2424. In some embodiments, pipeline controlcommand 2414 configures the pipeline state for the active pipeline. Inone embodiment, the pipeline control command 2414 is used for pipelinesynchronization and to clear data from one or more cache memories withinthe active pipeline before processing a batch of commands.

In some embodiments, return buffer state commands 2416 are used toconfigure a set of return buffers for the respective pipelines to writedata. Some pipeline operations require the allocation, selection, orconfiguration of one or more return buffers into which the operationswrite intermediate data during processing. In some embodiments, thegraphics processor also uses one or more return buffers to store outputdata and to perform cross thread communication. In some embodiments, thereturn buffer state 2416 includes selecting the size and number ofreturn buffers to use for a set of pipeline operations.

The remaining commands in the command sequence differ based on theactive pipeline for operations. Based on a pipeline determination 2420,the command sequence is tailored to the 3D pipeline 2422 beginning withthe 3D pipeline state 2430 or the media pipeline 2424 beginning at themedia pipeline state 2440.

The commands to configure the 3D pipeline state 2430 include 3D statesetting commands for vertex buffer state, vertex element state, constantcolor state, depth buffer state, and other state variables that are tobe configured before 3D primitive commands are processed. The values ofthese commands are determined at least in part based on the particular3D API in use. In some embodiments, 3D pipeline state 2430 commands arealso able to selectively disable or bypass certain pipeline elements ifthose elements will not be used.

In some embodiments, 3D primitive 2432 command is used to submit 3Dprimitives to be processed by the 3D pipeline. Commands and associatedparameters that are passed to the graphics processor via the 3Dprimitive 2432 command are forwarded to the vertex fetch function in thegraphics pipeline. The vertex fetch function uses the 3D primitive 2432command data to generate vertex data structures. The vertex datastructures are stored in one or more return buffers. In someembodiments, 3D primitive 2432 command is used to perform vertexoperations on 3D primitives via vertex shaders. To process vertexshaders, 3D pipeline 2422 dispatches shader execution threads tographics processor execution units.

In some embodiments, 3D pipeline 2422 is triggered via an execute 2434command or event. In some embodiments, a register write triggers commandexecution. In some embodiments execution is triggered via a ‘go’ or‘kick’ command in the command sequence. In one embodiment, commandexecution is triggered using a pipeline synchronization command to flushthe command sequence through the graphics pipeline. The 3D pipeline willperform geometry processing for the 3D primitives. Once operations arecomplete, the resulting geometric objects are rasterized and the pixelengine colors the resulting pixels. Additional commands to control pixelshading and pixel back end operations may also be included for thoseoperations.

In some embodiments, the graphics processor command sequence 2410follows the media pipeline 2424 path when performing media operations.In general, the specific use and manner of programming for the mediapipeline 2424 depends on the media or compute operations to beperformed. Specific media decode operations may be offloaded to themedia pipeline during media decode. In some embodiments, the mediapipeline can also be bypassed and media decode can be performed in wholeor in part using resources provided by one or more general purposeprocessing cores. In one embodiment, the media pipeline also includeselements for general-purpose graphics processor unit (GPGPU) operations,where the graphics processor is used to perform SIMD vector operationsusing computational shader programs that are not explicitly related tothe rendering of graphics primitives.

In some embodiments, media pipeline 2424 is configured in a similarmanner as the 3D pipeline 2422. A set of commands to configure the mediapipeline state 2440 are dispatched or placed into a command queue beforethe media object commands 2442. In some embodiments, media pipelinestate commands 2440 include data to configure the media pipelineelements that will be used to process the media objects. This includesdata to configure the video decode and video encode logic within themedia pipeline, such as encode or decode format. In some embodiments,media pipeline state commands 2440 also support the use of one or morepointers to “indirect” state elements that contain a batch of statesettings.

In some embodiments, media object commands 2442 supply pointers to mediaobjects for processing by the media pipeline. The media objects includememory buffers containing video data to be processed. In someembodiments, all media pipeline states must be valid before issuing amedia object command 2442. Once the pipeline state is configured andmedia object commands 2442 are queued, the media pipeline 2424 istriggered via an execute command 2444 or an equivalent execute event(e.g., register write). Output from media pipeline 2424 may then be postprocessed by operations provided by the 3D pipeline 2422 or the mediapipeline 2424. In some embodiments, GPGPU operations are configured andexecuted in a similar manner as media operations.

Graphics Software Architecture

FIG. 17 illustrates exemplary graphics software architecture for a dataprocessing system 2500 according to some embodiments. In someembodiments, software architecture includes a 3D graphics application2510, an operating system 2520, and at least one processor 2530. In someembodiments, processor 2530 includes a graphics processor 2532 and oneor more general-purpose processor core(s) 2534. The graphics application2510 and operating system 2520 each execute in the system memory 2550 ofthe data processing system.

In some embodiments, 3D graphics application 2510 contains one or moreshader programs including shader instructions 2512. The shader languageinstructions may be in a high-level shader language, such as the HighLevel Shader Language (HLSL) or the OpenGL Shader Language (GLSL). Theapplication also includes executable instructions 2514 in a machinelanguage suitable for execution by the general-purpose processor core2534. The application also includes graphics objects 2516 defined byvertex data.

In some embodiments, operating system 2520 is a Microsoft® Windows®operating system from the Microsoft Corporation, a proprietary UNIX-likeoperating system, or an open source UNIX-like operating system using avariant of the Linux kernel. The operating system 2520 can support agraphics API 2522 such as the Direct3D API, the OpenGL API, or theVulkan API. When the Direct3D API is in use, the operating system 2520uses a front-end shader compiler 2524 to compile any shader instructions2512 in HLSL into a lower-level shader language. The compilation may bea just-in-time (JIT) compilation or the application can perform shaderpre-compilation. In some embodiments, high-level shaders are compiledinto low-level shaders during the compilation of the 3D graphicsapplication 2510. In some embodiments, the shader instructions 2512 areprovided in an intermediate form, such as a version of the StandardPortable Intermediate Representation (SPIR) used by the Vulkan API.

In some embodiments, user mode graphics driver 2526 contains a back-endshader compiler 2527 to convert the shader instructions 2512 into ahardware specific representation. When the OpenGL API is in use, shaderinstructions 2512 in the GLSL high-level language are passed to a usermode graphics driver 2526 for compilation. In some embodiments, usermode graphics driver 2526 uses operating system kernel mode functions2528 to communicate with a kernel mode graphics driver 2529. In someembodiments, kernel mode graphics driver 2529 communicates with graphicsprocessor 2532 to dispatch commands and instructions.

IP Core Implementations

One or more aspects of at least one embodiment may be implemented byrepresentative code stored on a machine-readable medium which representsand/or defines logic within an integrated circuit such as a processor.For example, the machine-readable medium may include instructions whichrepresent various logic within the processor. When read by a machine,the instructions may cause the machine to fabricate the logic to performthe techniques described herein. Such representations, known as “IPcores,” are reusable units of logic for an integrated circuit that maybe stored on a tangible, machine-readable medium as a hardware modelthat describes the structure of the integrated circuit. The hardwaremodel may be supplied to various customers or manufacturing facilities,which load the hardware model on fabrication machines that manufacturethe integrated circuit. The integrated circuit may be fabricated suchthat the circuit performs operations described in association with anyof the embodiments described herein.

FIG. 18 is a block diagram illustrating an IP core development system2600 that may be used to manufacture an integrated circuit to performoperations according to an embodiment. The IP core development system2600 may be used to generate modular, re-usable designs that can beincorporated into a larger design or used to construct an entireintegrated circuit (e.g., an SOC integrated circuit). A design facility2630 can generate a software simulation 2610 of an IP core design in ahigh level programming language (e.g., C/C++). The software simulation2610 can be used to design, test, and verify the behavior of the IP coreusing a simulation model 2612. The simulation model 2612 may includefunctional, behavioral, and/or timing simulations. A register transferlevel (RTL) design 2615 can then be created or synthesized from thesimulation model 2612. The RTL design 2615 is an abstraction of thebehavior of the integrated circuit that models the flow of digitalsignals between hardware registers, including the associated logicperformed using the modeled digital signals. In addition to an RTLdesign 2615, lower-level designs at the logic level or transistor levelmay also be created, designed, or synthesized. Thus, the particulardetails of the initial design and simulation may vary.

The RTL design 2615 or equivalent may be further synthesized by thedesign facility into a hardware model 2620, which may be in a hardwaredescription language (HDL), or some other representation of physicaldesign data. The HDL may be further simulated or tested to verify the IPcore design. The IP core design can be stored for delivery to a 3^(rd)party fabrication facility 2665 using non-volatile memory 2640 (e.g.,hard disk, flash memory, or any non-volatile storage medium).Alternatively, the IP core design may be transmitted (e.g., via theInternet) over a wired connection 2650 or wireless connection 2660. Thefabrication facility 2665 may then fabricate an integrated circuit thatis based at least in part on the IP core design. The fabricatedintegrated circuit can be configured to perform operations in accordancewith at least one embodiment described herein.

Exemplary System on a Chip Integrated Circuit

FIGS. 19-21 illustrated exemplary integrated circuits and associatedgraphics processors that may be fabricated using one or more IP cores,according to various embodiments described herein. In addition to whatis illustrated, other logic and circuits may be included, includingadditional graphics processors/cores, peripheral interface controllers,or general purpose processor cores.

FIG. 19 is a block diagram illustrating an exemplary system on a chipintegrated circuit 2700 that may be fabricated using one or more IPcores, according to an embodiment. Exemplary integrated circuit 2700includes one or more application processor(s) 2705 (e.g., CPUs), atleast one graphics processor 2710, and may additionally include an imageprocessor 2715 and/or a video processor 2720, any of which may be amodular IP core from the same or multiple different design facilities.Integrated circuit 2700 includes peripheral or bus logic including a USBcontroller 2725, UART controller 2730, an SPI/SDIO controller 2735, andan I²S/I²C controller 2740. Additionally, the integrated circuit caninclude a display device 2745 coupled to one or more of ahigh-definition multimedia interface (HDMI) controller 2750 and a mobileindustry processor interface (MIPI) display interface 2755. Storage maybe provided by a flash memory subsystem 2760 including flash memory anda flash memory controller. Memory interface may be provided via a memorycontroller 2765 for access to SDRAM or SRAM memory devices. Someintegrated circuits additionally include an embedded security engine2770.

FIG. 20 is a block diagram illustrating an exemplary graphics processor2810 of a system on a chip integrated circuit that may be fabricatedusing one or more IP cores, according to an embodiment. Graphicsprocessor 2810 can be a variant of the graphics processor 2710 of FIG.19 . Graphics processor 2810 includes a vertex processor 2805 and one ormore fragment processor(s) 2815A-2815N (e.g., 2815A, 2815B, 2815C,2815D, through 2815N-1, and 2815N). Graphics processor 2810 can executedifferent shader programs via separate logic, such that the vertexprocessor 2805 is optimized to execute operations for vertex shaderprograms, while the one or more fragment processor(s) 2815A-2815Nexecute fragment (e.g., pixel) shading operations for fragment or pixelshader programs. The vertex processor 2805 performs the vertexprocessing stage of the 3D graphics pipeline and generates primitivesand vertex data. The fragment processor(s) 2815A-2815N use the primitiveand vertex data generated by the vertex processor 2805 to produce aframebuffer that is displayed on a display device. In one embodiment,the fragment processor(s) 2815A-2815N are optimized to execute fragmentshader programs as provided for in the OpenGL API, which may be used toperform similar operations as a pixel shader program as provided for inthe Direct 3D API.

Graphics processor 2810 additionally includes one or more memorymanagement units (MMUs) 2820A-2820B, cache(s) 2825A-2825B, and circuitinterconnect(s) 2830A-2830B. The one or more MMU(s) 2820A-2820B providefor virtual to physical address mapping for graphics processor 2810,including for the vertex processor 2805 and/or fragment processor(s)2815A-2815N, which may reference vertex or image/texture data stored inmemory, in addition to vertex or image/texture data stored in the one ormore cache(s) 2825A-2825B. In one embodiment the one or more MMU(s)2825A-2825B may be synchronized with other MMUs within the system,including one or more MMUs associated with the one or more applicationprocessor(s) 2705, image processor 2715, and/or video processor 2720 ofFIG. 19 , such that each processor 2705-2720 can participate in a sharedor unified virtual memory system. The one or more circuitinterconnect(s) 2830A-2830B enable graphics processor 2810 to interfacewith other IP cores within the SoC, either via an internal bus of theSoC or via a direct connection, according to embodiments.

FIG. 21 is a block diagram illustrating an additional exemplary graphicsprocessor 2910 of a system on a chip integrated circuit that may befabricated using one or more IP cores, according to an embodiment.Graphics processor 2910 can be a variant of the graphics processor 2710of FIG. 19 . Graphics processor 2910 includes the one or more MMU(s)2820A-2820B, caches 2825A-2825B, and circuit interconnects 2830A-2830Bof the graphics processor 2810 of FIG. 20 .

Graphics processor 2910 includes one or more shader core(s) 2915A-2915N(e.g., 2915A, 2915B, 2915C, 2915D, 2915E, 2915F, through 2915N-1, and2915N), which provides for a unified shader core architecture in which asingle core or type or core can execute all types of programmable shadercode, including shader program code to implement vertex shaders,fragment shaders, and/or compute shaders. The exact number of shadercores present can vary among embodiments and implementations.Additionally, graphics processor 2910 includes an inter-core taskmanager 2905, which acts as a thread dispatcher to dispatch executionthreads to one or more shader cores 2915A-2915N and a tiling unit 2918to accelerate tiling operations for tile-based rendering, in whichrendering operations for a scene are subdivided in image space, forexample to exploit local spatial coherence within a scene or to optimizeuse of internal caches.

Some embodiments pertain to Example 1 that includes an apparatus tofacilitate thread scheduling comprising logic to store barrier usagedata based on a magnitude of barrier messages in an application kerneland a scheduler to schedule the execution of threads across a pluralityof multiprocessors based on the barrier usage data.

Example 2 includes the subject matter of Example 1, further comprisingcompiling logic to analyze the application kernel to determine amagnitude of barrier messages.

Example 3 includes the subject matter of Examples 1 and 2, wherein thecompiling logic generates the barrier usage data based on the magnitudeof barrier messages in the application kernel.

Example 4 includes the subject matter of Examples 1-3, wherein thecompiling logic generates the barrier usage data by assigning a weightvalue based on the magnitude of barrier messages.

Example 5 includes the subject matter of Examples 1-4, wherein the logicto store the barrier usage data receives the barrier usage data andstores the barrier usage data as thread meta-data.

Example 6 includes the subject matter of Examples 1-5, wherein thescheduler schedules the execution of threads based on a schedulingpolicy that includes the barrier usage data and a load balancingprocess.

Example 7 includes the subject matter of Examples 1-6, wherein thescheduler performs the load balancing process based on a first costfunction generated for a received thread.

Example 8 includes the subject matter of Examples 1-7, wherein thescheduler performs a second cost function for the received thread basedon the barrier usage data.

Example 9 includes the subject matter of Examples 1-8, wherein thescheduler schedules the execution of the thread by performing a sum ofthe first cost function and the second cost function.

Example 10 includes the subject matter of Examples 1-9, wherein thescheduler schedules the execution of threads to schedule all threads ina thread group to a first of the plurality of multiprocessors.

Some embodiments pertain to Example 11 that includes a method tofacilitate thread scheduling comprising generating barrier usage databased on a magnitude of barrier messages in an application kernel andscheduling execution of threads across a plurality of multiprocessorsbased on the barrier usage data.

Example 12 includes the subject matter of Example 11, further comprisinganalyzing the application kernel to determine the magnitude of thebarrier messages in the application kernel and generating the barrierusage data based on the magnitude of barrier messages

Example 13 includes the subject matter of Examples 11 and 12, whereingenerating the barrier usage data comprises assigning a weight valuebased on the magnitude of barrier messages.

Example 14 includes the subject matter of Examples 11-13, furthercomprising storing the barrier usage data.

Example 15 includes the subject matter of Examples 11-14, wherein thebarrier usage data is stored as thread meta-data.

Example 16 includes the subject matter of Examples 11-15, whereinscheduling the execution of threads comprises scheduling the executionof threads based on a scheduling policy that includes the barrier usagedata and a load balancing process.

Example 17 includes the subject matter of Examples 11-16, furthercomprising performing the load balancing process based on a first costfunction generated for a received thread and performing a second costfunction for the received thread based on the barrier usage data

Example 18 includes the subject matter of Examples 11-17, furthercomprising scheduling the execution of the thread by performing a sum ofthe first cost function and the second cost function.

Some embodiments pertain to Example 19 that includes a computer readablemedium having instructions, which when executed by one or moreprocessors, cause the processors to generate barrier usage data based ona magnitude of barrier messages in an application kernel and scheduleexecution of threads across a plurality of multiprocessors based on thebarrier usage data.

Example 20 includes the subject matter of Example 19, havinginstructions, which when executed by the one or more processors, furthercauses the processors to analyze the application kernel to determine themagnitude of the barrier messages in the application kernel and generatethe barrier usage data based on the magnitude of barrier messages.

Some embodiments pertain to Example 21 that includes a computer readablemedium having instructions, which when executed by one or moreprocessors, cause the processors to perform the method of Examples11-18.

Some embodiments pertain to Example 22 that includes a system tofacilitate thread scheduling comprising means for generating barrierusage data based on a magnitude of barrier messages in an applicationkernel and means for scheduling execution of threads across a pluralityof multiprocessors based on the barrier usage data.

Example 23 includes the subject matter of Example 22, further comprisingmeans for analyzing the application kernel to determine the magnitude ofthe barrier messages in the application kernel and means for generatingthe barrier usage data based on the magnitude of barrier messages.

In addition to the above examples, one embodiment provides a processorcomprising a plurality of multiprocessors comprising single-instructionmultiple thread (SIMT) execution circuitry to simultaneously executemultiple threads; a shared local memory to be shared by the multiplethreads; and scheduling hardware logic to schedule the multiple threadsin a thread group for execution across the plurality of multiprocessorsin accordance with barrier data. The instructions of the multiplethreads are to produce shared data to be stored in the shared localmemory when executed by the plurality of multiprocessors, and whereinadditional instructions of at least a first thread of the multiplethreads are to use the shared data. In accordance with the barrier data,the first thread is to wait for other threads of the multiple threads tofinish producing the shared data before executing the additionalinstructions.

The foregoing description and drawings are to be regarded in anillustrative rather than a restrictive sense. Persons skilled in the artwill understand that various modifications and changes may be made tothe embodiments described herein without departing from the broaderspirit and scope of the invention as set forth in the appended claims.

What is claimed is:
 1. A processor comprising: a plurality ofmultiprocessors comprising single-instruction multiple thread (SIMT)execution circuitry to simultaneously execute multiple threads; a sharedlocal memory to be shared by the multiple threads; and schedulinghardware logic to schedule the multiple threads in a thread group forexecution across the plurality of multiprocessors in accordance withbarrier data, wherein instructions of the multiple threads are toproduce shared data to be stored in the shared local memory whenexecuted by the plurality of multiprocessors, and wherein additionalinstructions of at least a first thread of the multiple threads are touse the shared data; and wherein, in accordance with the barrier data,the first thread is to wait for other threads of the multiple threads tofinish producing the shared data before executing the additionalinstructions.
 2. The processor of claim 1, wherein the SIMT executioncircuitry is to cause the first thread to sleep while waiting for themultiple threads to finish producing the shared data.
 3. The processorof claim 1, wherein each multiprocessor of the plurality ofmultiprocessors comprises an equal portion of the SIMT executioncircuitry and an equal portion of the shared local memory, and at leasta portion of the shared data to be stored in the shared local memory isto be distributed between the plurality of multiprocessors via a datainterconnect coupled to the plurality of multiprocessors.
 4. Theprocessor of claim 3, wherein the equal portion of the SIMT executioncircuitry comprises a plurality of functional units or cores.
 5. Theprocessor of claim 4, wherein the plurality of functional units or corescomprises a number of floating-point units and/or integer units.
 6. Theprocessor of claim 1, further comprising: a memory interface to couplethe plurality of multiprocessors to a system memory.
 7. The processor ofclaim 6, wherein the system memory comprises a 3D stacked memory.
 8. Theprocessor of claim 7, further comprising: coherency hardware logic tomaintain coherency of the shared data.
 9. The processor of claim 1,wherein the instructions of the multiple threads include dot productinstructions.
 10. A method comprising: simultaneously executing multiplethreads via a plurality of multiprocessors comprising single-instructionmultiple thread (SIMT) execution circuitry, the multiple threads toshare a shared local memory; and scheduling the multiple threads in athread group for execution across the plurality of multiprocessors inaccordance with barrier data, wherein instructions of the multiplethreads are to produce shared data to be stored in the shared localmemory when executed by the plurality of multiprocessors, whereinadditional instructions of at least a first thread of the multiplethreads are to use the shared data, and wherein, in accordance with thebarrier data, the first thread is to wait for other threads of themultiple threads to finish producing the shared data before executingthe additional instructions.
 11. The method of claim 10, furthercomprising, via the SIMT execution circuitry, causing the first threadto sleep while waiting for the multiple threads to finish producing theshared data.
 12. The method of claim 10, wherein each multiprocessor ofthe plurality of multiprocessors comprises an equal portion of the SIMTexecution circuitry and an equal portion of the shared local memory, andat least a portion of the shared data to be stored in the shared localmemory is to be distributed between the plurality of multiprocessors viaa data interconnect coupled to the plurality of multiprocessors.
 13. Themethod of claim 12, wherein the equal portion of the SIMT executioncircuitry comprises a plurality of functional units or cores.
 14. Themethod of claim 13, wherein the plurality of functional units or corescomprises a number of floating-point units and/or integer units, theplurality of multiprocessors couple to a system memory via a memoryinterface, and the system memory comprises a 3D stacked memory.
 15. Themethod of claim 14, further comprising maintaining coherency of theshared data via coherency hardware logic.
 16. The method of claim 10,wherein the instructions of the multiple threads include dot productinstructions.
 17. A data processing system comprising: a memory device;and a processor coupled with the memory device, the processorcomprising: a plurality of multiprocessors comprising single-instructionmultiple thread (SIMT) execution circuitry to simultaneously executemultiple threads; a shared local memory to be shared by the multiplethreads; scheduling hardware logic to schedule the multiple threads in athread group for execution across the plurality of multiprocessors inaccordance with barrier data, wherein instructions of the multiplethreads are to produce shared data to be stored in the shared localmemory when executed by the plurality of multiprocessors and whereinadditional instructions of at least a first thread of the multiplethreads are to use the shared data; and wherein, in accordance with thebarrier data, the first thread is to wait for other threads of themultiple threads to finish producing the shared data before executingthe additional instructions.
 18. The processing system of claim 17,wherein the SIMT execution circuitry is to cause the first thread tosleep while waiting for the multiple threads to finish producing theshared data.
 19. The processing system of claim 17, wherein eachmultiprocessor of the plurality of multiprocessors comprises an equalportion of the SIMT execution circuitry and an equal portion of theshared local memory, and at least a portion of the shared data to bestored in the shared local memory is to be distributed between theplurality of multiprocessors via a data interconnect coupled to theplurality of multiprocessors.
 20. The processing system of claim 19,wherein the equal portion of the SIMT execution circuitry comprises aplurality of functional units or cores.
 21. The processing system ofclaim 20, wherein the plurality of functional units or cores comprises anumber of floating-point units and/or integer units.
 22. The processingsystem of claim 17, further comprising: a memory interface to couple theplurality of multiprocessors to a system memory.
 23. The processingsystem of claim 22, wherein the memory device and/or the system memorycomprises a 3D stacked memory.
 24. The processing system of claim 23,further comprising: coherency hardware logic to maintain coherency ofthe shared data.
 25. The processing system of claim 17, wherein theinstructions of the multiple threads include dot product instructions.